Sciweavers

1060 search results - page 126 / 212
» On the Discovery of Random Trees
Sort
View
SSDBM
2010
IEEE
105views Database» more  SSDBM 2010»
15 years 11 months ago
Organization of Data in Non-convex Spatial Domains
We present a technique for organizing data in spatial databases with non-convex domains based on an automatic characterization using the medial-axis transform (MAT). We define a t...
Eric A. Perlman, Randal C. Burns, Michael M. Kazhd...
HIPC
1999
Springer
15 years 10 months ago
High Performance Data Mining
Abstract. Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven ...
Vipin Kumar, Jaideep Srivastava
PAKDD
1998
ACM
103views Data Mining» more  PAKDD 1998»
15 years 10 months ago
Discovering Case Knowledge Using Data Mining
The use of Data Mining in removing current bottlenecks within Case-based Reasoning (CBR) systems is investigated along with the possible role of CBR in providing a knowledge manag...
Sarabjot S. Anand, David W. Patterson, John G. Hug...
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
16 years 6 months ago
Visually mining and monitoring massive time series
Moments before the launch of every space vehicle, engineering discipline specialists must make a critical go/no-go decision. The cost of a false positive, allowing a launch in spi...
Jessica Lin, Eamonn J. Keogh, Stefano Lonardi, Jef...
FSTTCS
1995
Springer
15 years 10 months ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain