Sciweavers

2783 search results - page 282 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
OOPSLA
2005
Springer
15 years 7 months ago
Using predicate fields in a highly flexible industrial control system
Predicate fields allow an object’s structure to vary at runtime based on the object’s state: a predicate field is present or not, depending on the values of other fields. P...
Shay Artzi, Michael D. Ernst
TLCA
2005
Springer
15 years 7 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger
VLSM
2005
Springer
15 years 7 months ago
A Variational Approach for Object Contour Tracking
In this paper we describe a new framework for the tracking of closed curves described through implicit surface modeling. The approach proposed here enables a continuous tracking al...
Nicolas Papadakis, Étienne Mémin, Fr...
APWEB
2004
Springer
15 years 7 months ago
Graphical Representation of XML Schema
XML is becoming the de-facto standard for exchanging information in distributed applications and services. This has resulted in the development of a large number of XML documents w...
Flora Dilys Salim, Rosanne Price, Maria Indrawan, ...
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 7 months ago
Relativized NP Search Problems and Propositional Proof Systems
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
Josh Buresh-Oppenheim, Tsuyoshi Morioka