Sciweavers

2430 search results - page 323 / 486
» Computing Tutte Polynomials
Sort
View
136
Voted
FGCS
2007
90views more  FGCS 2007»
15 years 3 months ago
Dual-Level Key Management for secure grid communication in dynamic and hierarchical groups
Grid computing is a newly developed technology for complex systems with large-scale resource sharing and multi-institutional collaboration. The prominent feature of grid computing...
Xukai Zou, Yuan-Shun Dai, Xiang Ran
101
Voted
SODA
2010
ACM
145views Algorithms» more  SODA 2010»
15 years 2 months ago
On the Equilibria of Alternating Move Games
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...
Aaron Roth, Maria-Florina Balcan, Adam Kalai, Yish...
WIOPT
2010
IEEE
15 years 2 months ago
Cooperative diversity routing in wireless networks
—In this paper, we explore physical layer cooperative communication in order to design network layer routing algorithms that are energy efficient. We assume each node in the net...
Mostafa Dehghan, Majid Ghaderi, Dennis Goeckel
149
Voted
OPODIS
2010
15 years 1 months ago
Tardiness Bounds for Global EDF with Deadlines Different from Periods
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
Jeremy Erickson, Nan Guan, Sanjoy K. Baruah
145
Voted
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
14 years 3 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...