Sciweavers

40 search results - page 5 / 8
» Can Random Coin Flips Speed Up a Computer
Sort
View
FOCS
2000
IEEE
14 years 19 hour ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
PODC
2009
ACM
14 years 8 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
SPIESR
2001
105views Database» more  SPIESR 2001»
13 years 9 months ago
Video summarization using motion descriptors
We describe a technique for video summarization that uses motion descriptors computed in the compressed domain to speed up conventional color based video summarization technique. ...
Ajay Divakaran, Kadir A. Peker, Huifang Sun
RECOMB
2003
Springer
14 years 8 months ago
Approximation of protein structure for fast similarity measures
It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C representation c...
Fabian Schwarzer, Itay Lotan
TNN
2008
152views more  TNN 2008»
13 years 7 months ago
Distributed Parallel Support Vector Machines in Strongly Connected Networks
We propose a distributed parallel support vector machine (DPSVM) training mechanism in a configurable network environment for distributed data mining. The basic idea is to exchange...
Yumao Lu, Vwani P. Roychowdhury, L. Vandenberghe