Sciweavers

320 search results - page 16 / 64
» Efficient noise-tolerant learning from statistical queries
Sort
View
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 19 days ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
14 years 8 months ago
Keyword query cleaning using hidden Markov models
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
Ken Q. Pu
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
14 years 7 months ago
Sampling cube: a framework for statistical olap over sampling data
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...
Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Y...
DEBU
2000
101views more  DEBU 2000»
13 years 7 months ago
Learning to Understand the Web
In a traditional information retrieval system, it is assumed that queries can be posed about any topic. In reality, a large fraction of web queries are posed about a relatively sm...
William W. Cohen, Andrew McCallum, Dallan Quass
DAC
2006
ACM
13 years 11 months ago
Refined statistical static timing analysis through
Statistical static timing analysis (SSTA) has been a popular research topic in recent years. A fundamental issue with applying SSTA in practice today is the lack of reliable and e...
Benjamin N. Lee, Li-C. Wang, Magdy S. Abadir