Sciweavers

3250 search results - page 51 / 650
» Parameterized Learning Complexity
Sort
View
ISOLA
2007
Springer
14 years 4 months ago
Using Invariant Detection Mechanism in Black Box Inference
The testing and formal verification of black box software components is a challenging domain. The problem is even harder when specifications of these components are not available...
Muzammil Shahbaz, Roland Groz
GLOBECOM
2006
IEEE
14 years 4 months ago
Low-Complexity Adaptive High-Resolution Channel Prediction for OFDM Systems
Abstract— We propose a low-complexity adaptive highresolution channel prediction algorithm for pilot symbol assisted orthogonal frequency division multiplexing (OFDM) systems. Th...
Ian C. Wong, Brian L. Evans
FSTTCS
2009
Springer
14 years 4 months ago
Domination Problems in Nowhere-Dense Classes
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
Anuj Dawar, Stephan Kreutzer
SG
2005
Springer
14 years 3 months ago
Multi-level Interaction in Parametric Design
Parametric design systems model a design as a constrained collection of schemata. Designers work in such systems at two levels: definition of schemata and constraints; and search w...
Robert Aish, Robert Woodbury
COLT
1991
Springer
14 years 1 months ago
On the Complexity of Teaching
While most theoretical work in machine learning has focused on the complexity of learning, recently there has been increasing interest in formally studying the complexity of teach...
Sally A. Goldman, Michael J. Kearns