Sciweavers

263 search results - page 34 / 53
» Splitting of Learnable Classes
Sort
View
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
14 years 22 days ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale
DM
2010
96views more  DM 2010»
13 years 8 months ago
On well-rounded sublattices of the hexagonal lattice
Abstract. We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameteriz...
Lenny Fukshansky, Daniel Moore, R. Andrew Ohana, W...
ALT
1998
Springer
14 years 27 days ago
Synthesizing Learners Tolerating Computable Noisy Data
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of recursive languages (by definition) ...
John Case, Sanjay Jain
TSMC
2002
142views more  TSMC 2002»
13 years 8 months ago
Adaptive color reduction
Abstract--This paper proposes a new algorithm for the reduction of the number of colors in an image. The proposed adaptive color reduction (ACR) technique achieves color reduction ...
Nikos Papamarkos, Antonios Atsalakis, Charalambos ...
ATAL
2007
Springer
14 years 2 months ago
Children in the forest: towards a canonical problem of spatio-temporal collaboration
Canonical problems are simplified representations of a class of real world problems. They allow researchers to compare algorithms in a standard setting which captures the most im...
Yi Luo, Ladislau Bölöni