2314 search results - page 359 / 463 » Minimal Partitions of a Graph |
174
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
193
click to vote
VC
2011
15 years 1 months ago
2011
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
155
click to vote
TSP
2010
15 years 1 months ago
2010
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
229
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
In this paper we address multi-view reconstruction of urban environments using 3D shape grammars. Our formulation expresses the solution to the problem as a shape grammar parse tr...
176
click to vote
EUROSYS
2006
ACM
16 years 3 months ago
2006
ACM
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...