211 search results - page 36 / 43 » BoostMap: A Method for Efficient Approximate Similarity Rank... |
MP
2008
13 years 7 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
To provide users with only relevant data from the huge amount of available information, personalization systems utilize preferences to allow users to express their interest on spe...
IJRR
2011
13 years 2 months ago
2011
This paper presents a novel method for online and incremental appearance-based localization and mapping in a highly dynamic environment. Using position-invariant robust features (...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...