Sciweavers

313 search results - page 60 / 63
» Shortest Paths in Distance-regular Graphs
Sort
View
SENSYS
2006
ACM
14 years 1 months ago
Scalable data aggregation for dynamic events in sensor networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
Kai-Wei Fan, Sha Liu, Prasun Sinha
WIRI
2005
IEEE
14 years 1 months ago
Collaborative Filtering by Mining Association Rules from User Access Sequences
Recent research in mining user access patterns for predicting Web page requests focuses only on consecutive sequential Web page accesses, i.e., pages which are accessed by followi...
Mei-Ling Shyu, Choochart Haruechaiyasak, Shu-Ching...
INFOCOM
2002
IEEE
14 years 12 days ago
Energy Efficient Communications in Ad Hoc Networks Using Directional Antennas
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...
Akis Spyropoulos, Cauligi S. Raghavendra
CCCG
2008
13 years 9 months ago
Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'...
CORR
2007
Springer
122views Education» more  CORR 2007»
13 years 7 months ago
How to Complete a Doubling Metric
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
Anupam Gupta, Kunal Talwar