Sciweavers

1629 search results - page 131 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
CHARME
2003
Springer
110views Hardware» more  CHARME 2003»
15 years 1 months ago
Exact and Efficient Verification of Parameterized Cache Coherence Protocols
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
E. Allen Emerson, Vineet Kahlon
MOBISYS
2008
ACM
15 years 9 months ago
Efficient channel-aware rate adaptation in dynamic environments
Increasingly, 802.11 devices are being used by mobile users. This results in very dynamic wireless channels that are difficult to use efficiently. Current rate selection algorithm...
Glenn Judd, Xiaohui Wang, Peter Steenkiste
100
Voted
WCNC
2008
IEEE
15 years 4 months ago
Distributed Energy Efficient Spectrum Access in Wireless Cognitive Radio Sensor Networks
—In this paper, a wireless cognitive radio sensor network is considered, where each sensor node is equipped with cognitive radio and the network is a multi-carrier system operati...
Song Gao, Lijun Qian, Dhadesugoor R. Vaman
WWW
2008
ACM
15 years 10 months ago
Video suggestion and discovery for youtube: taking random walks through the view graph
The rapid growth of the number of videos in YouTube provides enormous potential for users to find content of interest to them. Unfortunately, given the difficulty of searching vid...
Shumeet Baluja, Rohan Seth, D. Sivakumar, Yushi Ji...
91
Voted
AAAI
2006
14 years 11 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer