Sciweavers

1889 search results - page 293 / 378
» Re-ranking search results using query logs
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 6 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
VLDB
1990
ACM
106views Database» more  VLDB 1990»
15 years 10 months ago
The Time Index: An Access Structure for Temporal Data
In this paper, we describe a new indexing technique, the time indez, for improving the performance of certain classes of temporal queries. The time index can be used to retrieve v...
Ramez Elmasri, Gene T. J. Wuu, Yeong-Joon Kim
SEBD
1997
158views Database» more  SEBD 1997»
15 years 7 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...
ANLP
1994
86views more  ANLP 1994»
15 years 7 months ago
Robust Text Processing in Automated Information Retrieval
We report on the results of a series of experiments with a prototype text retrieval system which uses relatively advanced natural language processing techniques in order to enhanc...
Tomek Strzalkowski
CVPR
2012
IEEE
13 years 9 months ago
Multi-video browsing and summarization
We propose a method for browsing multiple videos with a common theme, such as the result of a search query on a video sharing website, or videos of an event covered by multiple ca...
Kevin Dale, Eli Shechtman, Shai Avidan, Hanspeter ...