Sciweavers

347 search results - page 53 / 70
» Schaefer's theorem for graphs
Sort
View
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
15 years 10 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
IJCAI
1989
14 years 10 months ago
And-Or Graphs Applied to RUE Resolution
In equality-based binary r e s o l u t i o n , the v i a b i l i t y t e s t is used as a decision mechanism to select disagreement sets and also to define the RUE u n i f i e r ....
Vincent J. Digricoli, James J. Lu, V. S. Subrahman...
CORR
2007
Springer
155views Education» more  CORR 2007»
14 years 9 months ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian
77
Voted
JCT
1998
193views more  JCT 1998»
14 years 9 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
DLOG
2009
14 years 7 months ago
Testing Provers on a Grid - Framework Description
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
Carlos Areces, Daniel Gorín, Alejandra Lore...