197 search results - page 22 / 40 » New Upper Bounds for Ramsey Numbers |
169
click to vote
FOCS
1995
IEEE
15 years 9 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
177
click to vote
COMGEO
2011
ACM
15 years 1 months ago
2011
ACM
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
175
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
168
Voted
MOBIHOC
2007
ACM
16 years 5 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
185
click to vote
ISMVL
2007
IEEE
16 years 11 days ago
2007
IEEE
This paper proposes a method to represent elementary functions such as trigonometric, logarithmic, square root, and reciprocal functions using edge-valued multi-valued decision di...