Sciweavers

811 search results - page 127 / 163
» When Novelty Is Not Enough
Sort
View
JAIR
2011
134views more  JAIR 2011»
13 years 3 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
TIT
2010
136views Education» more  TIT 2010»
13 years 3 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
IWMM
2011
Springer
245views Hardware» more  IWMM 2011»
12 years 11 months ago
Waste not, want not: resource-based garbage collection in a shared environment
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically. Sizing the heap too small can reduce throughput by increasing the...
Matthew Hertz, Stephen Kane, Elizabeth Keudel, Ton...
CVPR
2001
IEEE
14 years 10 months ago
Simultaneous linear estimation of multiple view geometry and lens distortion
A bugbear of uncalibrated stereo reconstruction is that cameras which deviate from the pinhole model have to be pre-calibrated in order to correct for nonlinear lens distortion. I...
Andrew W. Fitzgibbon
CVPR
2003
IEEE
14 years 10 months ago
Multi-scale Phase-based Local Features
Local feature methods suitable for image feature based object recognition and for the estimation of motion and structure are composed of two steps, namely the `where' and `wh...
Gustavo Carneiro, Allan D. Jepson