Sciweavers

2883 search results - page 380 / 577
» Algorithms for merged indexes
Sort
View
CIKM
2009
Springer
14 years 1 months ago
Density-based clustering using graphics processors
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics t...
Christian Böhm, Robert Noll, Claudia Plant, B...
ECML
2001
Springer
14 years 1 months ago
Mining the Web for Synonyms: PMI-IR versus LSA on TOEFL
Abstract. This paper presents a simple unsupervised learning algorithm for recognizing synonyms, based on statistical data acquired by querying a Web search engine. The algorithm, ...
Peter D. Turney
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
14 years 1 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
CIKM
2009
Springer
14 years 1 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
GOSLER
1995
14 years 23 days ago
A Guided Tour Across the Boundaries of Learning Recursive Languages
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
Thomas Zeugmann, Steffen Lange