269 search results - page 50 / 54 » Fast Parallel Similarity Search in Multimedia Databases |
EDBT
2002
ACM
15 years 10 months ago
2002
ACM
The amount of stored information is exploding while, at the same time, tools for accessing relevant information are rather under-developed. Usually, all users have a pre-defined vi...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
104
click to vote
VECPAR
2004
Springer
15 years 3 months ago
2004
Springer
Peer-to-peer (P2P) computing offers new opportunities for building highly distributed data systems. Unlike client-server computing, P2P can operate without central coordination and...
HPCN
1999
Springer
15 years 2 months ago
1999
Springer
The growing need of software infrastructure able to create, maintain and ease the evolution of scientific data, promotes the development of digital libraries in order to provide th...
BTW
2007
Springer
15 years 1 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...