6575 search results - page 304 / 1315 » Specializing visualization algorithms |
318
click to vote
TCSV
2011
15 years 1 months ago
2011
—We present in this paper an integrated solution to rapidly recognizing dynamic objects in surveillance videos by exploring various contextual information. This solution consists...
158
click to vote
GM
1999
Springer
15 years 11 months ago
1999
Springer
This paper is concerned with various aspects of the modeling of parallel curves on surfaces with special emphasis on surfaces of revolution. An algorithm for efficient tracking of...
158
click to vote
EURODAC
1994
IEEE
15 years 10 months ago
1994
IEEE
Cyclic corrector codes, or "block codes", are often used in telecommunications systems. To facilitate the design of coding/decoding circuits using this type of code, we ...
175
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
228
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...