Sciweavers

3406 search results - page 236 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
172
Voted
ICML
2007
IEEE
16 years 7 months ago
On learning linear ranking functions for beam search
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
Yuehua Xu, Alan Fern
TODS
2002
76views more  TODS 2002»
15 years 6 months ago
Searching for dependencies at multiple abstraction levels
g for Dependencies at Multiple Abstraction Levels Toon Calders Raymond T. Ng Jef Wijsen The notion of roll-up dependency (RUD) extends functional dependencies with generalization ...
Toon Calders, Raymond T. Ng, Jef Wijsen
CVPR
2010
IEEE
16 years 3 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 6 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...
MOBIHOC
2001
ACM
16 years 6 months ago
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
Seapahn Meguerdichian, Sasha Slijepcevic, Vahag Ka...