128 search results - page 20 / 26 » A random walk approach to sampling hidden databases |
NAACL
2003
14 years 11 months ago
2003
It is well known that frame independence assumption is a fundamental limitation of current HMM based speech recognition systems. By treating each speech frame independently, HMMs ...
ICDE
2007
IEEE
15 years 3 months ago
2007
IEEE
We consider the problem of semantic load shedding for continuous queries containing window joins on multiple data streams and propose a robust approach that is effective with the ...
101
click to vote
KDD
2010
ACM
14 years 8 months ago
2010
ACM
Information networks are widely used to characterize the relationships between data items such as text documents. Many important retrieval and mining tasks rely on ranking the dat...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...