Sciweavers

10608 search results - page 679 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ICRA
2007
IEEE
89views Robotics» more  ICRA 2007»
16 years 1 months ago
Probabilistic Strategies for Pursuit in Cluttered Environments with Multiple Robots
Abstract— In this paper, we describe a method for coordinating multiple robots in a pursuit-evasion domain. We examine the problem of multiple robotic pursuers attempting to loca...
Geoffrey Hollinger, Athanasios Kehagias, Sanjiv Si...
211
Voted
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
16 years 1 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
ICMCS
2005
IEEE
123views Multimedia» more  ICMCS 2005»
16 years 27 days ago
Fast predictive variable-block-size motion estimation for H.264/AVC
The emerging H.264 advanced video coding (H.264/AVC) standard achieves significant improvement in coding efficiency compared with previous standards such as MPEG-2 and H.263. On...
Zhi Yang, Jiajun Bu, Chun Chen, Xu Li
COMPGEOM
2004
ACM
16 years 22 days ago
New results on shortest paths in three dimensions
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
Joseph S. B. Mitchell, Micha Sharir
198
Voted
ISVLSI
2002
IEEE
129views VLSI» more  ISVLSI 2002»
16 years 6 days ago
Accelerating Retiming Under the Coupled-Edge Timing Model
Retiming has been shown to be a powerful technique for improving the performance of synchronous circuits. However, even though retiming algorithms of polynomial time complexity ha...
Ingmar Neumann, Kolja Sulimma, Wolfgang Kunz