Sciweavers

3946 search results - page 42 / 790
» The computational complexity of choice sets
Sort
View
GLVLSI
2007
IEEE
162views VLSI» more  GLVLSI 2007»
15 years 3 months ago
Utilizing custom registers in application-specific instruction set processors for register spills elimination
Application-specific instruction set processor (ASIP) has become an important design choice for embedded systems. It can achieve both high flexibility offered by the base processo...
Hai Lin, Yunsi Fei
RECSYS
2009
ACM
15 years 6 months ago
Regret-based optimal recommendation sets in conversational recommender systems
Current conversational recommender systems are unable to offer guarantees on the quality of their recommendations due to a lack of principled user utility models. We develop an ap...
Paolo Viappiani, Craig Boutilier
PPOPP
1999
ACM
15 years 4 months ago
Automatic Node Selection for High Performance Applications on Networks
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
Jaspal Subhlok, Peter Lieu, Bruce Lowekamp
CRV
2007
IEEE
231views Robotics» more  CRV 2007»
15 years 6 months ago
Establishing Visual Correspondence from Multi-Resolution Graph Cuts for Stereo-Motion
This paper presents the design and implementation of a multi-resolution graph cuts (MRGC) for stereo-motion framework that produces dense disparity maps. Both stereo and motion ar...
Joshua Worby, W. James MacLean
FGR
2011
IEEE
255views Biometrics» more  FGR 2011»
14 years 3 months ago
Beyond simple features: A large-scale feature search approach to unconstrained face recognition
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
David D. Cox, Nicolas Pinto