Sciweavers

7930 search results - page 478 / 1586
» Greedy in Approximation Algorithms
Sort
View
DAM
2008
131views more  DAM 2008»
15 years 7 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
ENTCS
2008
116views more  ENTCS 2008»
15 years 7 months ago
Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
Michele Baggi, Demis Ballis
AUTOMATICA
2006
98views more  AUTOMATICA 2006»
15 years 7 months ago
Stabilization of sampled-data nonlinear systems via backstepping on their Euler approximate model
Two integrator backstepping designs are presented for digitally controlled continuous-time plants in special form. The controller designs are based on the Euler approximate discre...
Dragan Nesic, Andrew R. Teel
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 7 months ago
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
Steven de Rooij, Paul M. B. Vitányi
JCP
2007
143views more  JCP 2007»
15 years 6 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio