Sciweavers

490 search results - page 90 / 98
» Practical Extensions to the IFDS Algorithm
Sort
View
CN
2008
100views more  CN 2008»
13 years 7 months ago
Building resilient low-diameter peer-to-peer topologies
As more applications rely on underlying peer-to-peer topologies, the need for efficient and resilient infrastructure has become more pressing. A number of important classes of top...
Rita H. Wouhaybi, Andrew T. Campbell
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 7 months ago
Clustering and Sharing Incentives in BitTorrent Systems
Peer-to-peer protocols play an increasingly instrumental role in Internet content distribution. It is therefore important to gain a complete understanding of how these protocols b...
Arnaud Legout, Nikitas Liogkas, Eddie Kohler, Lixi...
IJCV
2006
299views more  IJCV 2006»
13 years 7 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
TOG
2008
253views more  TOG 2008»
13 years 7 months ago
4-points congruent sets for robust pairwise surface registration
We introduce 4PCS, a fast and robust alignment scheme for 3D point sets that uses wide bases, which are known to be resilient to noise and outliers. The algorithm allows registeri...
Dror Aiger, Niloy J. Mitra, Daniel Cohen-Or
EDBT
2010
ACM
135views Database» more  EDBT 2010»
14 years 2 months ago
Region-based online promotion analysis
This paper addresses a fundamental and challenging problem with broad applications: efficient processing of region-based promotion queries, i.e., to discover the top-k most inter...
Tianyi Wu, Yizhou Sun, Cuiping Li, Jiawei Han