Sciweavers

1548 search results - page 264 / 310
» Optimization Services: A Framework for Distributed Optimizat...
Sort
View
SECON
2007
IEEE
14 years 2 months ago
INPoD: In-Network Processing over Sensor Networks based on Code Design
—In this paper, we develop a joint Network Coding (NC)-channel coding error-resilient sensor-network approach that performs In-Network Processing based on channel code Design (IN...
Kiran Misra, Shirish S. Karande, Hayder Radha
CCGRID
2010
IEEE
13 years 9 months ago
An MPI-Stream Hybrid Programming Model for Computational Clusters
The MPI programming model hides network type and topology from developers, but also allows them to seamlessly distribute a computational job across multiple cores in both an intra ...
Emilio Pasquale Mancini, Gregory Marsh, Dhabaleswa...
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 9 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
KDD
2007
ACM
201views Data Mining» more  KDD 2007»
14 years 9 months ago
Structural and temporal analysis of the blogosphere through community factorization
The blogosphere has unique structural and temporal properties since blogs are typically used as communication media among human individuals. In this paper, we propose a novel tech...
Yun Chi, Shenghuo Zhu, Xiaodan Song, Jun'ichi Tate...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine