Sciweavers

834 search results - page 33 / 167
» Computing Minimal Models, Stable Models, and Answer Sets
Sort
View
ENTCS
2008
72views more  ENTCS 2008»
14 years 12 months ago
Towards a Notion of Transaction in Graph Rewriting
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
Paolo Baldan, Andrea Corradini, Fernando Luí...
AAAI
2008
15 years 2 months ago
Optimal Metric Planning with State Sets in Automata Representation
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
Björn Ulrich Borowsky, Stefan Edelkamp
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
15 years 3 months ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo
CVPR
2005
IEEE
16 years 1 months ago
Face Recognition with Image Sets Using Manifold Density Divergence
In many automatic face recognition applications, a set of a person's face images is available rather than a single image. In this paper, we describe a novel method for face r...
Ognjen Arandjelovic, Gregory Shakhnarovich, John F...
ICDCS
2010
IEEE
15 years 1 months ago
Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
Qiang Zheng, Guohong Cao