Sciweavers

3775 search results - page 486 / 755
» The Expression Problem Revisited
Sort
View
APLAS
2005
ACM
16 years 8 days ago
Using Datalog with Binary Decision Diagrams for Program Analysis
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it easy to specify new analyses or extend or compose e...
John Whaley, Dzintars Avots, Michael Carbin, Monic...
SAC
2005
ACM
16 years 8 days ago
Selective method combination in mixin-based composition
A mixin is a reusable module that provides uniform extend modifications to classes. It is an abstract subclass that is composable with a variety of superclasses. In mixinbased co...
Tetsuo Kamina, Tetsuo Tamai
ATAL
2005
Springer
16 years 8 days ago
A computationally grounded logic of knowledge, belief and certainty
This paper presents a logic of knowledge, belief and certainty, which allows us to explicitly express the knowledge, belief and certainty of an agent. A computationally grounded m...
Kaile Su, Abdul Sattar, Guido Governatori, Qinglia...
CIVR
2005
Springer
16 years 7 days ago
Person Spotting: Video Shot Retrieval for Face Sets
Matching people based on their imaged face is hard because of the well known problems of illumination, pose, size and expression variation. Indeed these variations can exceed those...
Josef Sivic, Mark Everingham, Andrew Zisserman
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
16 years 7 days ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee