459 search results - page 47 / 92 » Computational Complexity of Probabilistic Disambiguation |
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
111
click to vote
SG
2005
Springer
15 years 5 months ago
2005
Springer
Parametric design systems model a design as a constrained collection of schemata. Designers work in such systems at two levels: definition of schemata and constraints; and search w...
115
click to vote
RC
2007
14 years 11 months ago
2007
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...
UAI
1997
15 years 1 months ago
1997
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
117
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents a method for visual object categorization based on encoding the joint textural information in objects and the surrounding background, and requiring no segmenta...