2168 search results - page 134 / 434 » Randomized Algorithms and Complexity Theory |
124
click to vote
ECCV
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. A novel method is proposed for performing multi-label, semi-automated image segmentation. Given a small number of pixels with user-defined labels, one can analytically (...
134
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
164
Voted
PODC
2012
ACM
13 years 5 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
139
click to vote
PODS
2006
ACM
16 years 3 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
124
Voted
MOBIHOC
2009
ACM
16 years 3 months ago
2009
ACM
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...