1405 search results - page 241 / 281 » Popularity at Minimum Cost |
173
Voted
SIGMOD
2012
ACM
13 years 6 months ago
2012
ACM
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
118
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
150
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
133
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
Getting trapped in suboptimal local minima is a perennial problem in model based vision, especially in applications like monocular human body tracking where complex nonlinear para...
154
click to vote
ECCV
2000
Springer
16 years 5 months ago
2000
Springer
Abstract. This paper presents anovel variational method forimage segmentation that uni es boundary and region-based information sources under the Geodesic Active Region framework. ...