5115 search results - page 136 / 1023 » On Randomized Lanczos Algorithms |
210
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
This work extends the existing static framework for joint flow control, routing and medium access control (MAC) in random access multi-hop wireless networks to a dynamic framewor...
164
click to vote
CRYPTO
2009
Springer
16 years 28 days ago
2009
Springer
sion of an extended abstract published in Proceedings of Crypto 2009, Springer-Verlag, 2009. Available from the IACR Cryptology ePrint Archive as Report 2008/510. We show that an ...
205
click to vote
CDC
2008
IEEE
16 years 25 days ago
2008
IEEE
— There has been much recent interest in protocol design for wireless networks based on maximizing a network utility function. A significant advance in recent years is the obser...
173
click to vote
ISCIS
2005
Springer
15 years 12 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
180
click to vote
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...