14699 search results - page 316 / 2940 » Complexity and Cognitive Computing |
117
click to vote
PG
2002
IEEE
15 years 9 months ago
2002
IEEE
Flocking behavior is very common in nature, and there have been ongoing research efforts to simulate such behavior in computer animations and robotics applications. Generally, suc...
149
click to vote
WG
2001
Springer
15 years 9 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
212
Voted
ISSAC
1997
Springer
15 years 8 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
142
click to vote
ICDCN
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
137
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...