Sciweavers

545 search results - page 83 / 109
» Estimating the Probability of Approximate Matches
Sort
View
108
Voted
WACV
2005
IEEE
15 years 6 months ago
Temporal Synchronization of Video Sequences in Theory and in Practice
— In this work, we present a formalization of the video synchronization problem that exposes new variants of the problem that have been left unexplored to date. We also present a...
Anthony Whitehead, Robert Laganière, Prosen...
116
Voted
SMA
2005
ACM
201views Solid Modeling» more  SMA 2005»
15 years 6 months ago
Fast and robust detection of crest lines on meshes
We propose a fast and robust method for detecting crest lines on surfaces approximated by dense triangle meshes. The crest lines, salient surface features defined via first- and...
Shin Yoshizawa, Alexander G. Belyaev, Hans-Peter S...
CORR
2007
Springer
135views Education» more  CORR 2007»
15 years 14 days ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
101
Voted
BMCBI
2007
129views more  BMCBI 2007»
15 years 23 days ago
Algebraic correction methods for computational assessment of clone overlaps in DNA fingerprint mapping
Background: The Sulston score is a well-established, though approximate metric for probabilistically evaluating postulated clone overlaps in DNA fingerprint mapping. It is known t...
Michael C. Wendl
97
Voted
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
16 years 29 days ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos