Sciweavers

3208 search results - page 363 / 642
» A Lower Bound for Primality
Sort
View
ICALP
2011
Springer
14 years 10 months ago
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
Arash Farzan, Shahin Kamali
INFOCOM
2012
IEEE
13 years 9 months ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
16 years 4 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
ICIP
2005
IEEE
16 years 8 months ago
Variational segmentation of color images
A variational Bayesian framework is employed in the paper for image segmentation using color clustering. A Gaussian mixture model is used to represent color distributions. Variati...
Nikolaos Nasios, Adrian G. Bors
ICIP
2003
IEEE
16 years 8 months ago
Fast similarity search on video signatures
Video signatures are compact representations of video sequences designed for efficient similarity measurement. In this paper, we propose a feature extraction technique to support ...
Sen-Ching S. Cheung, Avideh Zakhor