1405 search results - page 56 / 281 » Popularity at Minimum Cost |
141
click to vote
PAMI
2010
14 years 11 months ago
2010
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...
129
Voted
EUC
2005
Springer
15 years 10 months ago
2005
Springer
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...
160
click to vote
SIGCOMM
1995
ACM
15 years 8 months ago
1995
ACM
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...
147
click to vote
BMCBI
2008
15 years 5 months ago
2008
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...
143
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
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...