Sciweavers

3250 search results - page 24 / 650
» Parameterized Learning Complexity
Sort
View
ECCC
2008
79views more  ECCC 2008»
13 years 10 months ago
Valiant-Vazirani Lemmata for Various Logics
We show analogues of a theorem due to Valiant and Vazirani [16] for intractable parameterized complexity classes such as W[P], W[SAT] and the classes of the W-hierarchy as well as...
Moritz Müller
RC
2002
103views more  RC 2002»
13 years 9 months ago
Exact Minkowski Products of N Complex Disks
An exact parameterization for the boundary of the Minkowski product of N circular disks in the complex plane is derived. When N > 2, this boundary curve may be regarded as a gen...
Rida T. Farouki, Helmut Pottmann
ICFCA
2007
Springer
14 years 4 months ago
A Parameterized Algorithm for Exploring Concept Lattices
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
Peggy Cellier, Sébastien Ferré, Oliv...
CORR
1999
Springer
95views Education» more  CORR 1999»
13 years 9 months ago
Fixed-parameter tractability, definability, and model checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
Jörg Flum, Martin Grohe
ICASSP
2010
IEEE
13 years 8 months ago
Learning in Gaussian Markov random fields
This paper addresses the problem of state estimation in the case where the prior distribution of the states is not perfectly known but instead is parameterized by some unknown par...
Thomas J. Riedl, Andrew C. Singer, Jun Won Choi