Sciweavers

2498 search results - page 281 / 500
» Data Structures with Unpredictable Timing
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Modeling interleaved hidden processes
Hidden Markov models assume that observations in time series data stem from some hidden process that can be compactly represented as a Markov chain. We generalize this model by as...
Niels Landwehr
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 6 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
DASFAA
2008
IEEE
90views Database» more  DASFAA 2008»
16 years 1 months ago
Even an Ant Can Create an XSD
Abstract. The XML has undoubtedly become a standard for data representation and manipulation. But most of XML documents are still created without the respective description of its ...
Ondrej Vosta, Irena Mlynkova, Jaroslav Pokorn&yacu...
DEXAW
2007
IEEE
150views Database» more  DEXAW 2007»
16 years 26 days ago
Compressed Aggregations for mobile OLAP Dissemination
As wireless network infrastructure becomes more reliable, an increasing number of traditional desktop applications, beyond common web browsing, migrate to portable devices. Since ...
Ilias Michalarias, Arkadiy Omelchenko
ICDM
2007
IEEE
140views Data Mining» more  ICDM 2007»
16 years 26 days ago
Finding Cohesive Clusters for Analyzing Knowledge Communities
Documents and authors can be clustered into “knowledge communities” based on the overlap in the papers they cite. We introduce a new clustering algorithm, Streemer, which fin...
Vasileios Kandylas, S. Phineas Upham, Lyle H. Unga...