1632 search results - page 188 / 327 » Sublinear Time Algorithms for Metric Space Problems |
123
click to vote
URBAN
2008
15 years 4 months ago
2008
: There is a long tradition of describing cities through a focus on the characteristics of their residents. A brief review of the history of this approach to describing cities high...
155
click to vote
IJCV
2010
15 years 2 months ago
2010
We develop a computational model of shape that extends existing Riemannian models of shape of curves to multidimensional objects of general topological type. We construct shape sp...
113
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
136
click to vote
IANDC
2006
15 years 4 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
133
Voted
WCNC
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—We tackle the problem of providing minimum datarate guarantees for different classes-of-service in an OFDMAbased network, while obtaining a high system throughput. Our a...