Sciweavers

648 search results - page 76 / 130
» A general dimension for query learning
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer
SIGIR
2005
ACM
14 years 2 months ago
Iterative translation disambiguation for cross-language information retrieval
Finding a proper distribution of translation probabilities is one of the most important factors impacting the effectiveness of a crosslanguage information retrieval system. In th...
Christof Monz, Bonnie J. Dorr
JMLR
2008
100views more  JMLR 2008»
13 years 8 months ago
Hit Miss Networks with Applications to Instance Selection
In supervised learning, a training set consisting of labeled instances is used by a learning algorithm for generating a model (classifier) that is subsequently employed for decidi...
Elena Marchiori
CIKM
2008
Springer
13 years 10 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
14 years 9 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish