Sciweavers

4541 search results - page 571 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ICECCS
1998
IEEE
168views Hardware» more  ICECCS 1998»
15 years 11 months ago
The Architecture Tradeoff Analysis Method
This paper presents the Architecture Tradeoff Analysis Method (ATAM), a structured technique for understanding the tradeoffs inherent in design. This method was developed to provi...
Rick Kazman, Mark H. Klein, Mario Barbacci, Thomas...
INFOSCALE
2007
ACM
15 years 8 months ago
Query-driven indexing for scalable peer-to-peer text retrieval
We present a query-driven algorithm for the distributed indexing of large document collections within structured P2P networks. To cope with bandwidth consumption that has been ide...
Gleb Skobeltsyn, Toan Luu, Ivana Podnar Zarko, Mar...
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
15 years 5 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 7 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
ICML
2008
IEEE
16 years 8 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