Sciweavers

3415 search results - page 393 / 683
» Lower bounds on kernelization
Sort
View
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
SODA
2012
ACM
212views Algorithms» more  SODA 2012»
13 years 9 months ago
Parallelism and time in hierarchical self-assembly
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
Ho-Lin Chen, David Doty
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
ICIP
2001
IEEE
16 years 8 months ago
Curves vs skeletons in object recognition
The type of representation used in describing shape can have a significant impact on the effectiveness of a recognition strategy. Shape has been represented by its bounding curve ...
Thomas B. Sebastian, Benjamin B. Kimia