Sciweavers

240 search results - page 19 / 48
» On Efficient Construction of Decision Trees from Large Datab...
Sort
View
EDBT
2008
ACM
154views Database» more  EDBT 2008»
14 years 7 months ago
Ring-constrained join: deriving fair middleman locations from pointsets via a geometric constraint
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...
Man Lung Yiu, Panagiotis Karras, Nikos Mamoulis
PVLDB
2008
94views more  PVLDB 2008»
13 years 7 months ago
Dynamic active probing of helpdesk databases
Helpdesk databases are used to store past interactions between customers and companies to improve customer service quality. One common scenario of using helpdesk database is to fi...
Shenghuo Zhu, Tao Li, Zhiyuan Chen, Dingding Wang,...
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
13 years 11 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
IWMMDBMS
1998
139views more  IWMMDBMS 1998»
13 years 9 months ago
Fusion of Multimedia Information
: In recent years the fusion of multimedia information from multiple real-time sources and databases has become increasingly important because of its practical significance in many...
Shi-Kuo Chang, Taieb Znati
INTERSPEECH
2010
13 years 2 months ago
Autoregressive clustering for HMM speech synthesis
The autoregressive HMM has been shown to provide efficient parameter estimation and high-quality synthesis, but in previous experiments decision trees derived from a non-autoregre...
Matt Shannon, William Byrne