Sciweavers

2542 search results - page 413 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
TIP
2010
111views more  TIP 2010»
13 years 4 months ago
Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
Yue M. Lu, Mina Karzand, Martin Vetterli
HCI
2009
13 years 7 months ago
Acquiring a Physical World and Serving Its Mirror World Simultaneously
A mirror world, which is a virtual space modeling a physical space, attracts enormous interests from VR community recently. Various applications such as Second Life, Google Earth a...
Sengpyo Hong, Jong-gil Ahn, Heedong Ko, Jinwook Ki...
DAC
2009
ACM
14 years 11 months ago
Multicore parallel min-cost flow algorithm for CAD applications
Computational complexity has been the primary challenge of many VLSI CAD applications. The emerging multicore and manycore microprocessors have the potential to offer scalable perf...
Yinghai Lu, Hai Zhou, Li Shang, Xuan Zeng
RECOMB
2005
Springer
14 years 10 months ago
Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
CVPR
2007
IEEE
14 years 4 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...