539 search results - page 81 / 108 » Recurrence relations and fast algorithms |
116
click to vote
ICDM
2005
IEEE
15 years 6 months ago
2005
IEEE
Binary classification is a core data mining task. For large datasets or real-time applications, desirable classifiers are accurate, fast, and need no parameter tuning. We presen...
112
Voted
ALENEX
2010
15 years 2 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
126
click to vote
SAGT
2010
Springer
14 years 11 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
172
click to vote
ALGORITHMICA
2011
14 years 7 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
131
Voted
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
We describe an algorithm for similar-image search which
is designed to be efficient for extremely large collections of
images. For each query, a small response set is selected by...