Sciweavers

2168 search results - page 227 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
ICS
2005
Tsinghua U.
15 years 10 months ago
Low-power, low-complexity instruction issue using compiler assistance
In an out-of-order issue processor, instructions are dynamically reordered and issued to function units in their dataready order rather than their original program order to achiev...
Madhavi Gopal Valluri, Lizy Kurian John, Kathryn S...
CVPR
2007
IEEE
16 years 6 months ago
Optimizing Distribution-based Matching by Random Subsampling
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
Alex Po Leung, Shaogang Gong
CW
2002
IEEE
15 years 9 months ago
Free-Form Deformation with Automatically Generated Multiresolution Lattices
Developing intuitive and efficient methods for shape editing is one of the most important areas in computer graphics, and free-form deformation (FFD), which is one of such methods...
Yutaka Ono, Bing-Yu Chen, Tomoyuki Nishita, Jieqin...
CIMAGING
2009
184views Hardware» more  CIMAGING 2009»
15 years 5 months ago
Fast space-varying convolution and its application in stray light reduction
Space-varying convolution often arises in the modeling or restoration of images captured by optical imaging systems. For example, in applications such as microscopy or photography...
Jianing Wei, Guangzhi Cao, Charles A. Bouman, Jan ...
INFOCOM
2005
IEEE
15 years 10 months ago
Minimum energy accumulative routing in wireless networks
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
Jiangzhuo Chen, Lujun Jia, Xin Liu, Guevara Noubir...