Sciweavers

1405 search results - page 56 / 281
» Popularity at Minimum Cost
Sort
View
PAMI
2010
188views more  PAMI 2010»
14 years 4 months ago
Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three alg...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...
EUC
2005
Springer
15 years 3 months ago
Optimal Multicast Loop Algorithm for Multimedia Traffic Distribution
Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...
Yong-Jin Lee, Mohammed Atiquzzaman
SIGCOMM
1995
ACM
15 years 1 months ago
A Mobile User Location Update and Paging Mechanism Under Delay Constraints
A mobile user location management mechanism is introduced that incorporates a distance based location update scheme and a paging mechanism that satis es prede ned delay requiremen...
Ian F. Akyildiz, Joseph S. M. Ho
BMCBI
2008
114views more  BMCBI 2008»
14 years 9 months ago
Partial mixture model for tight clustering of gene expression time-course
Background: Tight clustering arose recently from a desire to obtain tighter and potentially more informative clusters in gene expression studies. Scattered genes with relatively l...
Yinyin Yuan, Chang-Tsun Li, Roland Wilson
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
15 years 7 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...