Sciweavers

2128 search results - page 20 / 426
» A general characterization of indulgence
Sort
View
DM
2008
115views more  DM 2008»
13 years 9 months ago
Characterizations of postman sets
Using results by McKee and Woodall on binary matroids, we prove that the set of postman sets has odd cardinality, generalizing a result by Toida on the cardinality of cycles in Eu...
Néstor E. Aguilera, Valeria A. Leoni
SCHEDULING
2010
116views more  SCHEDULING 2010»
13 years 8 months ago
Characterizing sets of jobs that admit optimal greedy-like algorithms
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Periklis A. Papakonstantinou, Charles Rackoff
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
14 years 1 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
CIE
2010
Springer
14 years 2 months ago
Ergodic-Type Characterizations of Algorithmic Randomness
A useful theorem of Kuˇcera states that given a Martin-L¨of random infinite binary sequence ω and an effectively open set A of measure less than 1, some tail of ω is not in A...
Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alex...
CIARP
2006
Springer
14 years 1 months ago
Linear Radial Patterns Characterization for Automatic Detection of Tonic Intestinal Contractions
This work tackles the categorization of general linear radial patterns by means of the valleys and ridges detection and the use of descriptors of directional information, which are...
Fernando Vilariño, Panagiota Spyridonos, Jo...