1890 search results - page 228 / 378 » Querying Big Data by Accessing Small Data |
DEBU
2000
14 years 11 months ago
2000
In a traditional information retrieval system, it is assumed that queries can be posed about any topic. In reality, a large fraction of web queries are posed about a relatively sm...
CIKM
2009
Springer
15 years 5 months ago
2009
Springer
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...
ECML
2006
Springer
15 years 3 months ago
2006
Springer
In many complex machine learning applications there is a need to learn multiple interdependent output variables, where knowledge of these interdependencies can be exploited to impr...
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
103
click to vote
EUC
2007
Springer
15 years 5 months ago
2007
Springer
Cooperative caching is an important technique to support efficient data dissemination and sharing in Mobile Ad hoc Networks (MANETs). In order to ensure valid data access, the cach...