Sciweavers

1810 search results - page 6 / 362
» Similarity estimation techniques from rounding algorithms
Sort
View
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 2 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
ICIP
2009
IEEE
14 years 7 months ago
An efficient and robust sequential algorithm for background estimation in video surveillance
Many computer vision algorithms such as object tracking and event detection assume that a background model of the scene under analysis is known. However, in many practical circums...
Vikas Reddy, Conrad Sanderson, Brian C. Lovell
FOCS
2003
IEEE
15 years 2 months ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
FSE
1998
Springer
137views Cryptology» more  FSE 1998»
15 years 1 months ago
Differential Cryptanalysis of the ICE Encryption Algorithm
ICE is a 64-bit block cipher presented at the Fast Software Encryption Workshop in January 1997. It introduced the concept of a keyed permutation to improve the resistance against ...
Bart Van Rompay, Lars R. Knudsen, Vincent Rijmen
BMCBI
2007
146views more  BMCBI 2007»
14 years 9 months ago
PubMed related articles: a probabilistic topic-based model for content similarity
Background: We present a probabilistic topic-based model for content similarity called pmra that underlies the related article search feature in PubMed. Whether or not a document ...
Jimmy J. Lin, W. John Wilbur