Sciweavers

4218 search results - page 302 / 844
» Complete sets of cooperations
Sort
View
194
Voted
DAC
2003
ACM
16 years 21 days ago
Dos and don'ts of CTL state coverage estimation
Coverage estimation for model checking quantifies the completeness of a set of properties. We present an improved version of the algorithm of Hoskote et al. [7] that applies to a...
Nikhil Jayakumar, Mitra Purandare, Fabio Somenzi
AC
2003
Springer
16 years 20 days ago
A Face Recognition System Based on Local Feature Characterization
A completely automatic face recognition system is presented. The method works on color and gray level images: after having localized the face and the facial features, it determines...
Paola Campadelli, Raffaella Lanzarotti
162
Voted
ICALP
2003
Springer
16 years 19 days ago
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
Stefan Blom, Wan Fokkink, Sumit Nain
204
Voted
ICDT
2003
ACM
125views Database» more  ICDT 2003»
16 years 19 days ago
XPath Containment in the Presence of Disjunction, DTDs, and Variables
XPath is a simple language for navigating an XML tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various fragm...
Frank Neven, Thomas Schwentick
202
Voted
CICLING
2001
Springer
15 years 12 months ago
Contextual Rules for Text Analysis
In this paper we describe a rule-based formalism for the analysis and labelling of texts segments. The rules are contextual rewriting rules with a restricted form of negation. They...
Dina Wonsever, Jean-Luc Minel