Sciweavers

5158 search results - page 20 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
13 years 11 months ago
Generalized matching from theory to application
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
JAIR
2012
211views Hardware» more  JAIR 2012»
11 years 10 months ago
Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
Joohyung Lee, Ravi Palla
ICDT
1990
ACM
110views Database» more  ICDT 1990»
13 years 11 months ago
Beginnings of a Theory of General Database Completions
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...
Stefan Brass
ICFP
2005
ACM
14 years 7 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
ICIP
2008
IEEE
14 years 2 months ago
General region merging approaches based on information theory statistical measures
This work presents a new statistical approach to region merging where regions are modeled as arbitrary discrete distributions, directly estimated from the pixel values. Under this...
Felipe Calderero, Ferran Marqués