Sciweavers

5499 search results - page 34 / 1100
» Generalized Rewrite Theories
Sort
View
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
ACL
1997
13 years 9 months ago
Compiling Regular Formalisms with Rule Features into Finite-State Automata
This paper presents an algorithm for the compilation of regular formalisms with rule features into finite-state automata. Rule features are incorporated into the right context of ...
George Anton Kiraz
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
JMLR
2006
105views more  JMLR 2006»
13 years 7 months ago
Some Theory for Generalized Boosting Algorithms
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...
Peter J. Bickel, Yaacov Ritov, Alon Zakai