7840 search results - page 203 / 1568 » On generalized Ramsey numbers |
190
click to vote
NIPS
1994
15 years 8 months ago
1994
The performance of on-line algorithms for learning dichotomies is studied. In on-line learning, the number of examples P is equivalent to the learning time, since each example is ...
230
click to vote
COMBINATORICA
2010
15 years 1 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
179
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
140
click to vote
ICCAD
2006
IEEE
16 years 20 days ago
2006
IEEE
Traditionally, at early design stages, leakage power is associated with the number of transistors in a design. Hence, intuitively an implementation with minimum resource usage wou...
175
click to vote
ENTCS
2006
15 years 6 months ago
2006
This is an extended version of an essay with the same title that I wrote for the workshop Algebraic Process Calculi: The First Twenty Five Years and Beyond, held in Bertinoro, Ita...