Sciweavers

288 search results - page 16 / 58
» Inclusion Problems for Patterns with a Bounded Number of Var...
Sort
View
STACS
2010
Springer
14 years 2 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
ICCD
1995
IEEE
100views Hardware» more  ICCD 1995»
13 years 11 months ago
Transformation of min-max optimization to least-square estimation and application to interconnect design optimization
This paper describes a novel approach to nd a tighter bound of the transformation of the Min-Max problems into the one of Least-Square Estimation. It is well known that the above ...
Jimmy Shinn-Hwa Wang, Wayne Wei-Ming Dai
TSP
2010
13 years 2 months ago
LS-CS-residual (LS-CS): compressive sensing on least squares residual
We consider the problem of recursively and causally reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of noisy...
Namrata Vaswani
IJCAI
1993
13 years 9 months ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
14 years 1 days ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic