Sciweavers

1067 search results - page 180 / 214
» Probabilistic regular graphs
Sort
View
120
Voted

Publication
167views
15 years 16 days ago
A Network Coding Approach to IP Traceback
Traceback schemes aim at identifying the source(s) of a sequence of packets and the nodes these packets traversed. This is useful for tracing the sources of high volume traffic, e...
Pegah Sattari, Minas Gjoka, Athina Markopoulou
PAMI
2010
190views more  PAMI 2010»
14 years 11 months ago
OBJCUT: Efficient Segmentation Using Top-Down and Bottom-Up Cues
—We present a probabilistic method for segmenting instances of a particular object category within an image. Our approach overcomes the deficiencies of previous segmentation tech...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 23 days ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
WWW
2005
ACM
16 years 1 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras
115
Voted
ECCV
2002
Springer
16 years 2 months ago
Transitions of the 3D Medial Axis under a One-Parameter Family of Deformations
The instabilities of the medial axis of a shape under deformations have long been recognized as a major obstacle to its use in recognition and other applications. These instabilit...
Peter J. Giblin, Benjamin B. Kimia