5448 search results - page 685 / 1090 » Breakpoints and Time in Distributed Computations |
202
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
194
click to vote
HPCA
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper presents elastic buffers (EBs), an efficient flow-control scheme that uses the storage already present in pipelined channels in place of explicit input virtualchannel b...
160
click to vote
CHI
2008
ACM
16 years 7 months ago
2008
ACM
We propose the "ninja cursor" to improve the performance of target acquisition, particularly on large screens. This technique uses multiple distributed cursors to reduce...
202
click to vote
EWSN
2004
Springer
16 years 6 months ago
2004
Springer
We consider the problem of inter-cluster routing between cluster heads via intermediate sensor nodes in a hierarchical sensor network. Sensor nodes having limited and unreplenishab...
182
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...