Sciweavers

845 search results - page 109 / 169
» Adaptive K-Means Clustering
Sort
View
IPTPS
2005
Springer
15 years 3 months ago
Hybrid Overlay Structure Based on Random Walks
Application-level multicast on structured overlays often suffer several drawbacks: 1) The regularity of the architecture makes it difficult to adapt to topology changes; 2) the u...
Ruixiong Tian, Yongqiang Xiong, Qian Zhang, Bo Li,...
ISMIR
2005
Springer
209views Music» more  ISMIR 2005»
15 years 3 months ago
SoniXplorer: Combining Visualization and Auralization for Content-Based Exploration of Music Collections
Music can be described best by music. However, current research in the design of user interfaces for the exploration of music collections has mainly focused on visualization aspec...
Dominik Lübbers
VLDB
1994
ACM
101views Database» more  VLDB 1994»
15 years 1 months ago
Memory-Contention Responsive Hash Joins
In order to maximize systemperformancein environments with fluctuating memory contention, memory-intensive algorithms such as hash join must gracefully adapt to variations in avai...
Diane L. Davison, Goetz Graefe
BMCBI
2002
81views more  BMCBI 2002»
14 years 9 months ago
Species-specific protein sequence and fold optimizations
Background: An organism's ability to adapt to its particular environmental niche is of fundamental importance to its survival and proliferation. In the largest study of its k...
Michel Dumontier, Katerina Michalickova, Christoph...
CLUSTER
2009
IEEE
15 years 4 months ago
Oblivious routing schemes in extended generalized Fat Tree networks
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
Germán Rodríguez, Cyriel Minkenberg,...