Sciweavers

1247 search results - page 104 / 250
» A Generalization of Jumps and Labels
Sort
View
TABLEAUX
2007
Springer
14 years 4 months ago
Tree-Sequent Methods for Subintuitionistic Predicate Logics
Subintuitionistic logics are a class of logics defined by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate lo...
Ryo Ishigaki, Kentaro Kikuchi
ICCV
2005
IEEE
14 years 4 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
14 years 2 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
LICS
1998
IEEE
14 years 2 months ago
A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages
In this paper we describe the promoted tyft tyxt rule format for de ning higher-order languages. The rule format is a generalization of Groote and Vaandrager's tyft tyxt form...
Karen L. Bernstein
STACS
1991
Springer
14 years 2 months ago
The RELVIEW-System
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
Rudolf Berghammer, Gunther Schmidt