Sciweavers

1629 search results - page 34 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
INFOCOM
2000
IEEE
15 years 2 months ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor
KDD
2009
ACM
237views Data Mining» more  KDD 2009»
15 years 10 months ago
Exploring social tagging graph for web object classification
This paper studies web object classification problem with the novel exploration of social tags. Automatically classifying web objects into manageable semantic categories has long ...
Zhijun Yin, Rui Li, Qiaozhu Mei, Jiawei Han
TKDE
2002
239views more  TKDE 2002»
14 years 9 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik
JCM
2007
129views more  JCM 2007»
14 years 9 months ago
Evolutionary Approach for Efficient Resource Allocation in Multi-User OFDM Systems
– Orthogonal Frequency Division Multiplexing is a promising technology for high data rate transmission in wideband wireless systems for achieving high downlink capabilities in th...
Yenumula B. Reddy, Nandigam Gajendar
CASES
2003
ACM
15 years 1 months ago
A hierarchical approach for energy efficient application design using heterogeneous embedded systems
Several features such as reconfiguration, voltage and frequency scaling, low-power operating states, duty-cycling, etc. are exploited for latency and energy efficient application ...
Sumit Mohanty, Viktor K. Prasanna