4171 search results - page 437 / 835 » Choice numbers of graphs |
169
Voted
WG
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
229
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
307
Voted
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
149
Voted
GLOBECOM
2006
IEEE
16 years 28 days ago
2006
IEEE
— While the Internet continues to thrive, the resiliency of its fundamental routing infrastructure is not fully understood. In this paper, we analyze the behavior of the de facto...
290
Voted
LCTRTS
2005
Springer
16 years 11 days ago
2005
Springer
Short vector (SIMD) instructions are useful in signal processing, multimedia, and scientific applications. They offer higher performance, lower energy consumption, and better res...