1986 search results - page 296 / 398 » Path Separability of Graphs |
112
click to vote
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
Multi-target tracking requires locating the targets and labeling their identities. The latter is a challenge when many targets, with indistinct appearances, frequently occlude one...
120
Voted
DAC
2006
ACM
16 years 3 months ago
2006
ACM
Since performance on FPGAs is dominated by the routing architecture rather than wirelength, we propose a new architecture-aware approach to initial FPGA placement that models the ...
125
Voted
CCS
2009
ACM
16 years 3 months ago
2009
ACM
In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, mo...
133
Voted
RECOMB
2005
Springer
16 years 2 months ago
2005
Springer
: A series of genome-scale algorithms and high-performance implementations is described and shown to be useful in the genetic analysis of gene transcription. With them it is possib...
111
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...