Sciweavers

473 search results - page 92 / 95
» Computing shortest paths with uncertainty
Sort
View
DAC
2004
ACM
15 years 10 months ago
Memory access scheduling and binding considering energy minimization in multi-bank memory systems
Memory-related activity is one of the major sources of energy consumption in embedded systems. Many types of memories used in embedded systems allow multiple operating modes (e.g....
Chun-Gi Lyuh, Taewhan Kim
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
15 years 10 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
15 years 9 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
79
Voted
MOBISYS
2007
ACM
15 years 9 months ago
Energy-efficient multi-hop medical sensor networking
Abstract-- Wireless sensor networks represent a key technology enabler for enhanced health care and assisted living systems. Recent standardization efforts to ensure compatibility ...
Antonio G. Ruzzelli, Raja Jurdak, Gregory M. P. O'...
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 4 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen