Sciweavers

97 search results - page 18 / 20
» Learning to combine distances for complex representations
Sort
View
CVPR
2006
IEEE
13 years 11 months ago
Perceptually-Inspired and Edge-Directed Color Image Super-Resolution
Inspired by multi-scale tensor voting, a computational framework for perceptual grouping and segmentation, we propose an edge-directed technique for color image superresolution gi...
Yu-Wing Tai, Wai-Shun Tong, Chi-Keung Tang
RAS
2010
164views more  RAS 2010»
13 years 4 months ago
Towards performing everyday manipulation activities
This article investigates fundamental issues in scaling autonomous personal robots towards open-ended sets of everyday manipulation tasks which involve high complexity and vague j...
Michael Beetz, Dominik Jain, Lorenz Mösenlech...
AAAI
2010
13 years 7 months ago
Efficient Lifting for Online Probabilistic Inference
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
Aniruddh Nath, Pedro Domingos
GECCO
2009
Springer
14 years 6 days ago
On the performance effects of unbiased module encapsulation
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and em...
R. Paul Wiegand, Gautham Anil, Ivan I. Garibay, Oz...
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 14 days ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu