Sciweavers

4037 search results - page 115 / 808
» Routing without ordering
Sort
View
FSEN
2009
Springer
14 years 3 months ago
Termination in Higher-Order Concurrent Calculi
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
LFCS
2009
Springer
14 years 3 months ago
A Clausal Approach to Proof Analysis in Second-Order Logic
This work defines an extension CERES2 of the first-order cut-elimination method CERES to the subclass of sequent calculus proofs in second-order logic using quantifier-free comp...
Stefan Hetzl, Alexander Leitsch, Daniel Weller, Br...
LICS
2006
IEEE
14 years 3 months ago
The Boundedness Problem for Monadic Universal First-Order Logic
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
Martin Otto
EDBTW
2004
Springer
14 years 2 months ago
L-Tree: A Dynamic Labeling Structure for Ordered XML Data
With the ever growing use of XML as a data representation format, we see an increasing need for robust, high performance XML database systems. While most of the recent work focuses...
Yi Chen, George A. Mihaila, Rajesh Bordawekar, Sri...
ECCV
2010
Springer
14 years 2 months ago
TriangleFlow: Optical Flow with Triangulation-based Higher-Order Likelihoods
Abstract. We use a simple yet powerful higher-order conditional random field (CRF) to model optical flow. It consists of a standard photoconsistency cost and a prior on affine mo...