27354 search results - page 4771 / 5471 » Distributed And Parallel Computing |
175
click to vote
FOCS
1994
IEEE
15 years 11 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
175
click to vote
ICCAD
1994
IEEE
15 years 11 months ago
1994
IEEE
In this paper, we study the simultaneousdriver and wire sizing (SDWS) problem under two objective functions: (i) delay minimization only, or (ii) combined delay and power dissipat...
190
click to vote
ISTCS
1993
Springer
15 years 11 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
172
click to vote
SIGGRAPH
1994
ACM
15 years 11 months ago
1994
ACM
Rotated dispersed-dot dither is proposed as a new dither technique for digital halftoning. It is based on the discrete one-to-one rotation of a Bayer dispersed-dot dither array. D...
200
Voted
ACCV
2007
Springer
15 years 11 months ago
2007
Springer
In dynamic scenes with occluding objects many features need to be tracked for a robust real-time camera pose estimation. An open problem is that tracking too many features has a ne...