Sciweavers

10457 search results - page 1975 / 2092
» Data Mapping as Search
Sort
View
VLDB
2001
ACM
94views Database» more  VLDB 2001»
15 years 2 months ago
FeedbackBypass: A New Approach to Interactive Similarity Query Processing
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
Ilaria Bartolini, Paolo Ciaccia, Florian Waas
MOBICOM
2000
ACM
15 years 2 months ago
Caching strategies in on-demand routing protocols for wireless ad hoc networks
An on-demand routing protocol for wireless ad hoc networks is one that searches for and attempts to discover a route to some destination node only when a sending node originates a...
Yih-Chun Hu, David B. Johnson
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
15 years 2 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
ELPUB
1998
ACM
15 years 2 months ago
The Library in the Card: Results from Decomate Project and Current Developments at UAB
The Library in the card is the slogan which would summarize the aims of the Univeritat Autonoma de Barcelona (UAB) Library Service in its involvement in several EC Libraries Progr...
Nuria Gallart
STACS
1992
Springer
15 years 2 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
« Prev « First page 1975 / 2092 Last » Next »