2924 search results - page 120 / 585 » Lower Bounds in Distributed Computing |
83
Voted
ICCV
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
129
click to vote
SPAA
2004
ACM
15 years 6 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
109
click to vote
CORR
2010
Springer
15 years 22 days ago
2010
Springer
We obtain a tight distribution-specific characterization of the sample complexity of large-margin classification with L2 regularization: We introduce the -adapted-dimension, which...
104
Voted
ALGORITHMICA
2010
15 years 24 days ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
107
Voted
GC
2007
Springer
15 years 18 days ago
2007
Springer
Let G be a connected graph of order n and girth g. If dG(u) + dG(v) ≥ n − 2g + 5 for any two non-adjacent vertices u and v, then G is up-embeddable. Further more, the lower bou...