5138 search results - page 269 / 1028 » Randomized Algorithms for 3-SAT |
188
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Interactive image segmentation traditionally involves the
use of algorithms such as Graph Cuts or Random Walker.
Common concerns with using Graph Cuts are metrication
artifacts ...
280
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
159
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
158
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
183
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...