Sciweavers

614 search results - page 120 / 123
» Decision Trees for Uncertain Data
Sort
View
ICDE
2010
IEEE
177views Database» more  ICDE 2010»
14 years 3 months ago
Optimal load shedding with aggregates and mining queries
— To cope with bursty arrivals of high-volume data, a DSMS has to shed load while minimizing the degradation of Quality of Service (QoS). In this paper, we show that this problem...
Barzan Mozafari, Carlo Zaniolo
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
14 years 3 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
13 years 12 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
IJCAI
1989
13 years 9 months ago
Noise-Tolerant Instance-Based Learning Algorithms
Several published reports show that instancebased learning algorithms yield high classification accuracies and have low storage requirements during supervised learning application...
David W. Aha, Dennis F. Kibler
BMCBI
2007
146views more  BMCBI 2007»
13 years 8 months ago
Spatial location and its relevance for terminological inferences in bio-ontologies
Background: An adequate and expressive ontological representation of biological organisms and their parts requires formal reasoning mechanisms for their relations of physical aggr...
Stefan Schulz, Kornél G. Markó, Udo ...