39 search results - page 3 / 8 » Leveraging COUNT Information in Sampling Hidden Databases |
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
The availability of summary data for XML documents has many applications, from providing users with quick feedback about their queries, to cost-based storage design and query opti...
NIPS
2007
13 years 8 months ago
2007
We investigate a family of inference problems on Markov models, where many sample paths are drawn from a Markov chain and partial information is revealed to an observer who attemp...
KAIS
2011
13 years 2 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
ICDE
2004
IEEE
14 years 8 months ago
2004
IEEE
An ever increasing amount of valuable information is stored in Web databases, "hidden" behind search interfaces. To save the user's effort in manually exploring eac...
CIKM
2009
Springer
14 years 1 days ago
2009
Springer
This paper describes a hidden Markov model (HMM) based approach to perform search interface segmentation. Automatic processing of an interface is a must to access the invisible co...