Sciweavers

921 search results - page 143 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
121
Voted
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
16 years 4 months ago
SoundCompass: A Practical Query-by-Humming System
This paper describes our practical query-by-humming system, SoundCompass, which is being used as a karaoke song selection system in Japan. First, we describe the fundamental techn...
Naoko Kosugi, Yasushi Sakurai, Masashi Morimoto
KDD
2005
ACM
161views Data Mining» more  KDD 2005»
16 years 4 months ago
Combining email models for false positive reduction
Machine learning and data mining can be effectively used to model, classify and discover interesting information for a wide variety of data including email. The Email Mining Toolk...
Shlomo Hershkop, Salvatore J. Stolfo
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
15 years 3 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
VLDB
2004
ACM
137views Database» more  VLDB 2004»
15 years 9 months ago
Schema-Free XQuery
The widespread adoption of XML holds out the promise that document structure can be exploited to specify precise database queries. However, the user may have only a limited knowle...
Yunyao Li, Cong Yu, H. V. Jagadish
ICAISC
2010
Springer
15 years 8 months ago
An Evolutionary Algorithm for Global Induction of Regression Trees
In the paper a new evolutionary algorithm for induction of univariate regression trees is proposed. In contrast to typical top-down approaches it globally searches for the best tre...
Marek Kretowski, Marcin Czajkowski