Sciweavers

1405 search results - page 115 / 281
» Popularity at Minimum Cost
Sort
View
ILP
2004
Springer
15 years 9 months ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...
MDM
2010
Springer
188views Communications» more  MDM 2010»
15 years 2 months ago
A Distributed Technique for Dynamic Operator Placement in Wireless Sensor Networks
—We present an optimal distributed algorithm to adapt the placement of a single operator in high communication cost networks, such as a wireless sensor network. Our parameterfree...
Georgios Chatzimilioudis, Nikos Mamoulis, Dimitrio...
CORR
2011
Springer
164views Education» more  CORR 2011»
14 years 11 months ago
Sweeping an oval to a vanishing point
Given a convex region in the plane, and a sweep-line as a tool, what is best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by ...
Adrian Dumitrescu, Minghui Jiang
CVPR
2009
IEEE
16 years 11 months ago
Global Active Contour-based Image Segmentation via Probability Alignment
Active contours is a popular technique for image segmentation. However, active contour tend to converge to the closest local minimum of its energy function and often requires a ...
Andriy Myronenko, Xubo B. Song
CVPR
2008
IEEE
1042views Computer Vision» more  CVPR 2008»
16 years 6 months ago
Graph cut based image segmentation with connectivity priors
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother