905 search results - page 70 / 181 » On the Complexity of uSPR Distance |
ISAAC
2007
Springer
15 years 4 months ago
2007
Springer
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
DATE
2006
IEEE
15 years 3 months ago
2006
IEEE
Network-on-Chip (NoC)-based communication represents a promising solution to complex on-chip communication problems. Due to their regular structure, mesh-like NoC architectures ha...
AVSS
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper presents a new approach for tracking objects in complex situations such as people in a crowd or players on a soccer field. Each object in the image is represented by s...
IPTPS
2005
Springer
15 years 3 months ago
2005
Springer
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
ICRA
2003
IEEE
15 years 3 months ago
2003
IEEE
s - For the on-line safe path planning of a mobile robot in unknown environments, the paper proposes a simple Hopfield Neural Network ( HNN ) planner. Without learning process, the...