Sciweavers

1768 search results - page 261 / 354
» Mining Very Large Databases
Sort
View
EDBT
2008
ACM
120views Database» more  EDBT 2008»
16 years 2 months ago
Flint: Google-basing the Web
Several Web sites deliver a large number of pages, each publishing data about one instance of some real world entity, such as an athlete, a stock quote, a book. Even though it is ...
Lorenzo Blanco, Valter Crescenzi, Paolo Merialdo, ...
EDBT
2010
ACM
117views Database» more  EDBT 2010»
15 years 9 months ago
Anchoring millions of distinct reads on the human genome within seconds
With the advent of next-generation DNA sequencing machines, there is an increasing need for the development of computational tools that can anchor accurately and expediently the m...
Tien Huynh, Michail Vlachos, Isidore Rigoutsos
117
Voted
ICASSP
2008
IEEE
15 years 9 months ago
Graph laplacian for interactive image retrieval
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in a step-by-step lab...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
103
Voted
ICDE
2007
IEEE
152views Database» more  ICDE 2007»
15 years 8 months ago
Automatically Identifying Known Software Problems
Re-occurrence of the same problem is very common in many large software products. By matching the symptoms of a new problem to those in a database of known problems, automated dia...
Natwar Modani, Rajeev Gupta, Guy M. Lohman, Tanvee...
118
Voted
CIKM
2005
Springer
15 years 8 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...