563 search results - page 20 / 113 » Computing approximate PSD factorizations |
119
Voted
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
Robotic swarms, like all spatial computers, are a challenging environment for the execution of distributed consensus algorithms due to their scale, diameter, and frequent failures...
119
Voted
COCO
2004
Springer
15 years 4 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
120
Voted
WAOA
2005
Springer
15 years 6 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
113
click to vote
SIGCOMM
2006
ACM
15 years 7 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
118
Voted
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
Camera networks have gained increased importance in
recent years. Previous approaches mostly used point correspondences
between different camera views to calibrate
such systems....