425 search results - page 23 / 85 » On the additive constant of the k-server Work Function Algor... |
148
click to vote
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
We address the problem of visual category recognition by learning an image-to-image distance function that attempts to satisfy the following property: the distance between images ...
119
Voted
SIAMCO
2002
15 years 3 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
117
Voted
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
156
click to vote
SDM
2012
SIAM
13 years 5 months ago
2012
SIAM
: Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
219
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...