Sciweavers

554 search results - page 101 / 111
» Optimizing in Graphs with Expensive Computation of Edge Weig...
Sort
View
IPPS
2005
IEEE
14 years 2 months ago
Bootstrapping Free-Space Optical Networks
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
Fang Liu, Uzi Vishkin, Stuart Milner
VMV
2003
143views Visualization» more  VMV 2003»
13 years 10 months ago
Animating a Camera for Viewing a Planar Polygon
Many applications, ranging from visualization applications such as architectural walkthroughs to robotic applications such as surveillance, could benefit from an automatic camera ...
Daniel Brunstein, Gill Barequet, Craig Gotsman
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
14 years 3 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
CIKM
2009
Springer
14 years 3 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...