Sciweavers

60 search results - page 7 / 12
» A Separator Theorem for String Graphs and its Applications
Sort
View
JCT
1998
193views more  JCT 1998»
13 years 6 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
BIRTHDAY
1991
Springer
13 years 10 months ago
The Markgraf Karl Refutation Procedure
The goal of the MKRP project is the development of a theorem prover which can be used as an inference engine in various applications, in particular it should be capable of proving ...
Hans Jürgen Ohlbach, Jörg H. Siekmann
ALGOSENSORS
2004
Springer
14 years 3 days ago
On a Conjecture Related to Geometric Routing
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
Christos H. Papadimitriou, David Ratajczak
NIPS
2004
13 years 8 months ago
Binet-Cauchy Kernels
We propose a family of kernels based on the Binet-Cauchy theorem and its extension to Fredholm operators. This includes as special cases all currently known kernels derived from t...
S. V. N. Vishwanathan, Alex J. Smola
TIT
2010
138views Education» more  TIT 2010»
13 years 1 months ago
Functional compression through graph coloring
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
Vishal Doshi, Devavrat Shah, Muriel Médard,...