Sciweavers

108 search results - page 10 / 22
» Exact Exploration and Hanging Algorithms
Sort
View
PVLDB
2010
97views more  PVLDB 2010»
13 years 6 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
14 years 2 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
ECCV
2008
Springer
14 years 9 months ago
Object Recognition by Integrating Multiple Image Segmentations
The joint tasks of object recognition and object segmentation from a single image are complex in their requirement of not only correct classification, but also deciding exactly whi...
Caroline Pantofaru, Cordelia Schmid, Martial Heber...
JAIR
2008
148views more  JAIR 2008»
13 years 7 months ago
Learning Partially Observable Deterministic Action Models
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Eyal Amir, Allen Chang
GECCO
2009
Springer
13 years 11 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom