Sciweavers

1242 search results - page 114 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
ICIP
2001
IEEE
15 years 11 months ago
B-spline active contours for fast video segmentation
Video segmentation is among the most important challenges of video processing and compression (MPEG-4 and MPEG-7). A drawback of classical methods is the computational cost due to...
Frédéric Precioso, Michel Barlaud
JELIA
1998
Springer
15 years 2 months ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche
ICPR
2010
IEEE
15 years 1 months ago
Monogenic Binary Pattern (MBP): A Novel Feature Extraction and Representation Model for Face Recognition
A novel feature extraction method, namely monogenic binary pattern (MBP), is proposed in this paper based on the theory of monogenic signal analysis, and the histogram of MBP (HMB...
Meng Yang, Lei Zhang, Lin Zhang, David Zhang
PODC
2011
ACM
14 years 24 days ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
CORR
2010
Springer
141views Education» more  CORR 2010»
14 years 10 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson