1671 search results - page 84 / 335 » On the Covering Steiner Problem |
123
click to vote
SWAT
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
102
Voted
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
We propose a novel consistent max-covering scheme for
human pose estimation. Consistent max-covering formulates
pose estimation as the covering of body part polygons
on an objec...
113
click to vote
ICML
2001
IEEE
16 years 1 months ago
2001
IEEE
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
110
Voted
WOWMOM
2009
ACM
15 years 7 months ago
2009
ACM
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
In case the objective function to be minimized is not known analytically and no assumption can be made about the single extremum, global optimization (GO) methods must be used. Pap...