1046 search results - page 41 / 210 » Approximation Algorithms for Domination Search |
217
Voted
CVIU
2011
14 years 7 months ago
2011
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
132
click to vote
WEA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
95
Voted
IPMU
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
151
Voted
STOC
2006
ACM
16 years 22 days ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
102
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...