406 search results - page 66 / 82 » Pseudorandomness and Combinatorial Constructions |
STACS
2012
Springer
12 years 5 months ago
2012
Springer
A mode of a multiset S is an element a ∈ S of maximum multiplicity; that is, a occurs at least as frequently as any other element in S. Given an array A[1 : n] of n elements, we...
CVPR
2008
IEEE
2008
IEEE
Discovering class specific composite features through discriminative sampling with Swendsen-Wang Cut
14 years 12 months ago
This paper proposes a novel approach to discover a set of class specific "composite features" as the feature pool for the detection and classification of complex objects...
CVPR
2008
IEEE
14 years 12 months ago
2008
IEEE
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
STOC
2004
ACM
14 years 10 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...