179 search results - page 24 / 36 » Space Bounded Computations: Review And New Separation Result... |
161
Voted
ICDE
2006
IEEE
15 years 12 months ago
2006
IEEE
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
MP
2006
14 years 10 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
104
click to vote
SODA
2003
ACM
14 years 11 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
82
Voted
ECCV
2010
Springer
15 years 3 months ago
2010
Springer
Bourdev and Malik (ICCV 09) introduced a new notion of parts, poselets, constructed to be tightly clustered both in the configuration space of keypoints, as well as in the appeara...
93
Voted
ICCV
2009
IEEE
16 years 3 months ago
2009
IEEE
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NP-har...