Sciweavers

2168 search results - page 286 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
127
Voted
CVPR
2010
IEEE
15 years 9 months ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan
141
Voted
DIMVA
2007
15 years 5 months ago
On the Adaptive Real-Time Detection of Fast-Propagating Network Worms
Abstract. We present two light-weight worm detection algorithms that offer significant advantages over fixed-threshold methods. The first algorithm, RBS (ratebased sequential hy...
Jaeyeon Jung, Rodolfo A. Milito, Vern Paxson
BMCBI
2008
128views more  BMCBI 2008»
15 years 3 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
130
Voted
PODS
2006
ACM
96views Database» more  PODS 2006»
16 years 3 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
SBACPAD
2007
IEEE
128views Hardware» more  SBACPAD 2007»
15 years 9 months ago
Node Level Primitives for Parallel Exact Inference
We present node level primitives for parallel exact inference on an arbitrary Bayesian network. We explore the probability representation on each node of Bayesian networks and eac...
Yinglong Xia, Viktor K. Prasanna