Sciweavers

1629 search results - page 98 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
DATE
2004
IEEE
145views Hardware» more  DATE 2004»
15 years 1 months ago
Hierarchical Adaptive Dynamic Power Management
Dynamic power management aims at extending battery life by switching devices to lower-power modes when there is a reduced demand for service. Static power management strategies can...
Zhiyuan Ren, Bruce H. Krogh, Radu Marculescu
APVIS
2009
14 years 11 months ago
Extending the spring-electrical model to overcome warping effects
The spring-electrical model based force directed algorithm is widely used for drawing undirected graphs, and sophisticated implementations can be very efficient for visualizing la...
Yifan Hu, Yehuda Koren
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
15 years 10 months ago
SNARE: a link analytic system for graph labeling and risk detection
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
Mary McGlohon, Stephen Bay, Markus G. Anderle, Dav...
MOBISYS
2010
ACM
15 years 8 days ago
NAPman: network-assisted power management for wifi devices
WiFi radios in smart-phones consume a significant amount of power when active. The 802.11 standard allows these devices to save power through an energy-conserving Power Save Mode ...
Eric Rozner, Vishnu Navda, Ramachandran Ramjee, Sh...
CG
2002
Springer
14 years 9 months ago
Tackling Post's Correspondence Problem
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
Ling Zhao