1632 search results - page 36 / 327 » Sublinear Time Algorithms for Metric Space Problems |
129
click to vote
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
126
click to vote
ICTCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
129
Voted
CCCG
2007
15 years 4 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
148
click to vote
ICPR
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
146
Voted
EDBT
2011
ACM
14 years 6 months ago
2011
ACM
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...