Sciweavers

131 search results - page 22 / 27
» A General Method for Reducing the Complexity of Relational I...
Sort
View
MMB
2010
Springer
194views Communications» more  MMB 2010»
14 years 15 days ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
IMC
2010
ACM
13 years 5 months ago
Eyeball ASes: from geography to connectivity
This paper presents a new approach to determine the geographical footprint of individual Autonomous Systems that directly provide service to end-users, i.e.,eyeball ASes. The key ...
Amir H. Rasti, Nazanin Magharei, Reza Rejaie, Walt...
CRYPTO
2003
Springer
156views Cryptology» more  CRYPTO 2003»
14 years 28 days ago
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
Nicolas Courtois
PPOPP
2009
ACM
14 years 8 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
UBIMOB
2009
ACM
225views Management» more  UBIMOB 2009»
14 years 11 days ago
Historical data storage for large scale sensor networks
Wireless sensor networks are rapidly finding their way through a plethora of new applications like precision farming and forestry, with increasing network scale, system complexit...
Loïc Petit, Abdelhamid Nafaa, Raja Jurdak