5580 search results - page 760 / 1116 » Randomized priority algorithms |
176
click to vote
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
16 years 3 months ago
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
221
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
We introduce a novel data-driven mean-shift belief propagation
(DDMSBP) method for non-Gaussian MRFs, which
often arise in computer vision applications. With the aid
of scale sp...
161
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
—Data compression techniques such as null suppression and dictionary compression are commonly used in today’s database systems. In order to effectively leverage compression, it...
159
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
Equivalence checking and property checking are powerful techniques to detect error traces. Debugging these traces is a time consuming design task where automation provides help. I...
177
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— This paper presents a methodology based on a variation of the Rapidly-exploring Random Trees (RRTs) that generates feasible trajectories for autonomous aerial vehicles with hol...