Sciweavers

635 search results - page 11 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
ACL
2010
14 years 7 months ago
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
Sylvain Schmitz
DIS
2003
Springer
15 years 2 months ago
Abduction and the Dualization Problem
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
Thomas Eiter, Kazuhisa Makino
IJCAI
2003
14 years 11 months ago
Generalizing Plans to New Environments in Relational MDPs
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...
ICPR
2008
IEEE
15 years 10 months ago
Relative advantage of touch over vision in the exploration of texture
Texture segmentation is an effortless process in scene analysis, yet its mechanisms have not been sufficiently understood. A common assumption in most current approaches is that t...
Choonseog Park, Yoon Ho Bai, Yoonsuck Choe
EMMCVPR
2009
Springer
15 years 4 months ago
General Search Algorithms for Energy Minimization Problems
We describe a scheme for solving Energy Minimization problems, which is based on the A∗ algorithm accomplished with appropriately chosen LP-relaxations as heuristic functions. Th...
Dmitrij Schlesinger