Sciweavers

5506 search results - page 719 / 1102
» Minimal Logic Programs
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 6 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
ICPR
2006
IEEE
16 years 7 months ago
A Minimum Sphere Covering Approach to Pattern Classification
In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formul...
Jigang Wang, Predrag Neskovic, Leon N. Cooper
ASPLOS
2009
ACM
16 years 1 months ago
Recovery domains: an organizing principle for recoverable operating systems
We describe a strategy for enabling existing commodity operating systems to recover from unexpected run-time errors in nearly any part of the kernel, including core kernel compone...
Andrew Lenharth, Vikram S. Adve, Samuel T. King
GLOBECOM
2007
IEEE
16 years 1 months ago
Robust Chebyshev FIR Equalization
Abstract—In Chebyshev finite-impulse response (FIR) equalization, we design an FIR filter that minimizes the Chebyshev equalization error, i.e., the maximum absolute deviation ...
Almir Mutapcic, Seung-Jean Kim, Stephen P. Boyd
GLOBECOM
2007
IEEE
16 years 1 months ago
Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
Vahid Shah-Mansouri, Vincent W. S. Wong