Publications
2000. Iterative regularization and MINRES. SIAM Journal on Matrix Analysis and Applications. 21(2):613-628.
2007. Grow and Know: Understanding Record-keeping Needs for Tracking the Development of Young Children. SIGCHI '07. :1351-1360.
2005. CASPER: an integrated energy-driven approach for task graph scheduling on distributed embedded systems. Application-Specific Systems, Architecture Processors, 2005. ASAP 2005. 16th IEEE International Conference on. :191-197.
2006. Efficient techniques for clustering and scheduling onto embedded multiprocessors. IEEE Transactions on Parallel and Distributed Systems. :667-680.
2005. An architectural level design methodology for embedded face detection. Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis. :136-141.
2004. CHARMED: A multi-objective co-synthesis framework for multi-mode embedded systems. Application-Specific Systems, Architectures and Processors, 2004. Proceedings. 15th IEEE International Conference on. :28-40.
1996. Compressed-domain document retrieval and analysis. SPIE Conference of Multimedia Storage and Archiving Systems. 2916(1):176-187.
1996. Structural compression for document analysis. Pattern Recognition, 1996., Proceedings of the 13th International Conference on. 3:664-668vol.3-664-668vol.3.
1998. Document Image Coding for Processing and Retrieval. Journal of VLSI Signal Processing. 20:121-135.
2000. Residual coding in document image compression. Image Processing, IEEE Transactions on. 9(6):961-969.
1997. The role of compressed document images in transmission and retrieval. Multimedia Signal Processing, 1997., IEEE First Workshop on. :331-336.
1997. OCR-based rate-distortion analysis of residual coding. Image Processing, 1997. Proceedings., International Conference on. 3:690-693vol.3-690-693vol.3.
1997. Integrated Segmentation and Clustering for Enhanced Compression of Document Images. ICDAR. :406-406.
2011. Visual Analysis of Temporal Trends in Social Networks Using Edge Color Coding and Metric Timelines. Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom). :549-554.
1994. On the parallel complexity of digraph reachability. Information Processing Letters. 52(5):239-241.
2007. Finding most probable worlds of probabilistic logic programs. Scalable Uncertainty Management. :45-59.
2000. On local search and placement of meters in networks. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. :319-328.
1993. The lattice structure of flow in planar graphs. SIAM Journal on Discrete Mathematics. 6:477-477.
2004. Equivalence of two linear programming relaxations for broadcast scheduling. Operations Research Letters. 32(5):473-478.