Sciweavers

1146 search results - page 146 / 230
» Finite cupping sets
Sort
View
COLOGNETWENTE
2009
13 years 11 months ago
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
Stavros D. Nikolopoulos, Charis Papadopoulos
ICML
2010
IEEE
13 years 11 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
ADCM
2010
59views more  ADCM 2010»
13 years 10 months ago
Sampling inequalities for infinitely smooth functions, with applications to interpolation and machine learning
Sampling inequalities give a precise formulation of the fact that a differentiable function cannot attain large values, if its derivatives are bounded and if it is small on a suff...
Christian Rieger, Barbara Zwicknagl
ADCM
2008
111views more  ADCM 2008»
13 years 10 months ago
Sigma-delta quantization errors and the traveling salesman problem
In transmission, storaging and coding of digital signals we frequently perform A/D conversion using quantization. In this paper we study the maxiaml and mean square errors as a res...
Yang Wang
APAL
2008
104views more  APAL 2008»
13 years 10 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy