Sciweavers

1743 search results - page 115 / 349
» Generalized Modal Satisfiability
Sort
View
67
Voted
COMBINATORICS
2002
70views more  COMBINATORICS 2002»
15 years 19 days ago
Set-Systems with Restricted Multiple Intersections
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, ...
Vince Grolmusz
106
Voted
JAL
2002
86views more  JAL 2002»
15 years 15 days ago
Exploiting structure in quantified formulas
We study the computational problem "find the value of the quantified formula obtained by quantifying the variables in a sum of terms." The "sum" can be based o...
Richard Edwin Stearns, Harry B. Hunt III
75
Voted
TIT
2002
68views more  TIT 2002»
15 years 13 days ago
A Lagrangian formulation of Zador's entropy-constrained quantization theorem
Abstract--Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd...
Robert M. Gray, Tamás Linder, Jia Li
106
Voted
TIT
2002
72views more  TIT 2002»
15 years 13 days ago
Principal curves with bounded turn
Principal curves, like principal components, are a tool used in multivariate analysis for ends like feature extraction. Defined in their original form, principal curves need not ex...
S. Sandilya, Sanjeev R. Kulkarni
102
Voted
DM
2008
107views more  DM 2008»
14 years 11 months ago
Set maps, umbral calculus, and the chromatic polynomial
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying pS(x + y) = TU=S pT (x)pU (y). Using umbral calculus, we give a formula for t...
Gus Wiseman