11051 search results - page 210 / 2211 » An Investigation of Generalized Cases |
175
click to vote
COLT
2005
Springer
16 years 3 days ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
179
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
230
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
152
click to vote
PAMI
2008
15 years 6 months ago
2008
This paper addresses the problem of visual tracking under very general conditions: a possibly nonrigid target whose appearance may drastically change over time, general camera moti...
168
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...