Sciweavers

32 search results - page 1 / 7
» Boosting Based on Divide and Merge
Sort
View
ALT
2004
Springer
14 years 1 months ago
Boosting Based on Divide and Merge
Eiji Takimoto, Syuhei Koya, Akira Maruoka
EVOW
2008
Springer
13 years 6 months ago
Divide, Align and Full-Search for Discovering Conserved Protein Complexes
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
Pavol Jancura, Jaap Heringa, Elena Marchiori
LCPC
2000
Springer
13 years 8 months ago
Recursion Unrolling for Divide and Conquer Programs
This paper presents recursion unrolling, a technique for improving the performance of recursive computations. Conceptually, recursion unrolling inlines recursive calls to reduce c...
Radu Rugina, Martin C. Rinard
ICDE
2007
IEEE
148views Database» more  ICDE 2007»
14 years 6 months ago
Conquering the Divide: Continuous Clustering of Distributed Data Streams
Data is often collected over a distributed network, but in many cases, is so voluminous that it is impractical and undesirable to collect it in a central location. Instead, we mus...
Graham Cormode, S. Muthukrishnan, Wei Zhuang
FSS
2010
147views more  FSS 2010»
13 years 3 months ago
A divide and conquer method for learning large Fuzzy Cognitive Maps
Fuzzy Cognitive Maps (FCMs) are a convenient tool for modeling and simulating dynamic systems. FCMs were applied in a large number of diverse areas and have already gained momentu...
Wojciech Stach, Lukasz A. Kurgan, Witold Pedrycz