Sciweavers

721 search results - page 83 / 145
» Graphs with Large Obstacle Numbers
Sort
View
ICRA
2007
IEEE
146views Robotics» more  ICRA 2007»
14 years 3 months ago
Crowds of Moving Objects: Navigation Planning and Simulation
Abstract— This paper presents a solution to interactive navigation planning and real-time simulation of a very large number of entities moving in a virtual environment. From the ...
Julien Pettré, Helena Grillon, Daniel Thalm...
VLSID
1996
IEEE
130views VLSI» more  VLSID 1996»
14 years 1 months ago
A systolic architecture for LMS adaptive filtering with minimal adaptation delay
Existing systolic architectures for the LMS algorithm with delayed coeficient adaptation have large adaptation delay and hence degraded convergence behaviour. This paper presents ...
S. Ramanathan, V. Visvanathan
ADHOCNOW
2004
Springer
14 years 2 months ago
Analysis of the Information Propagation Time Among Mobile Hosts
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. ...
VLDB
1994
ACM
118views Database» more  VLDB 1994»
14 years 1 months ago
Query Optimization by Predicate Move-Around
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagi...
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 10 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...