Sciweavers

2432 search results - page 186 / 487
» Degrees and choice numbers
Sort
View
CORR
2010
Springer
190views Education» more  CORR 2010»
15 years 6 months ago
Overlap properties of geometric expanders
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assa...
IMECS
2007
15 years 8 months ago
Knowledge Acquisition from Computer Log Files by ADG with Variable Agent Size
Abstract—We had previously proposed an outstanding evolutionary method, Automatically Defined Groups (ADG), for generating heterogeneous cooperative agents, and then we had deve...
Akira Hara, Yoshiaki Kurosawa, Takumi Ichimura
SIROCCO
2007
15 years 7 months ago
Fast Periodic Graph Exploration with Constant Memory
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
Leszek Gasieniec, Ralf Klasing, Russell A. Martin,...
SPAA
2009
ACM
16 years 1 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
IMA
2007
Springer
137views Cryptology» more  IMA 2007»
16 years 18 days ago
Algebraic Cryptanalysis of the Data Encryption Standard
In spite of growing importance of AES, the Data Encryption Standard is by no means obsolete. DES has never been broken from the practical point of view. The triple DES is believed ...
Nicolas Courtois, Gregory V. Bard