Sciweavers

1594 search results - page 18 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
ICPR
2006
IEEE
16 years 23 days ago
Fast Dichotomic Multiple Search Algorithm for Shortest Cirular Path
Circular shortest path algorithms for polar objects segmentation have been proposed in [1, 11, 10] to address discrete case and extended in [2] to the continuous domain for closed...
Martin de La Gorce, Nikos Paragios
CGI
2009
IEEE
15 years 3 months ago
Easy integral surfaces: a fast, quad-based stream and path surface algorithm
Despite the clear benefits that stream and path surfaces bring when visualizing 3D vector fields, their use in both industry and for research has not proliferated. This is due, in...
Tony McLoughlin, Robert S. Laramee, Eugene Zhang
MICRO
2000
IEEE
107views Hardware» more  MICRO 2000»
14 years 11 months ago
An integrated approach to accelerate data and predicate computations in hyperblocks
To exploit increased instruction-level parallelism available in modern processors, we describe the formation and optimization of tracenets, an integrated approach to reducing the ...
Alexandre E. Eichenberger, Waleed Meleis, Suman Ma...
LCN
1999
IEEE
15 years 3 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen
132
Voted
ASSETS
2008
ACM
15 years 1 months ago
Computer vision-based clear path guidance for blind wheelchair users
We describe a system for guiding blind and visually impaired wheelchair users along a clear path that uses computer vision to sense the presence of obstacles or other terrain feat...
Volodymyr Ivanchenko, James Coughlan, William Gerr...