Sciweavers

29 search results - page 6 / 6
» A sorting network in bounded arithmetic
Sort
View
INFOCOM
1997
IEEE
13 years 10 months ago
A Near-Optimal Packet Scheduler for QoS Networks
A packet scheduler in a quality-of-service QoS network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implemen...
Dallas E. Wrege, Jörg Liebeherr
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
14 years 8 days ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
CTRSA
2004
Springer
114views Cryptology» more  CTRSA 2004»
13 years 11 months ago
Flexible Hardware Design for RSA and Elliptic Curve Cryptosystems
This paper presents a scalable hardware implementation of both commonly used public key cryptosystems, RSA and Elliptic Curve Cryptosystem (ECC) on the same platform. The introduce...
Lejla Batina, Geeke Bruin-Muurling, Siddika Berna ...
ICDE
2009
IEEE
179views Database» more  ICDE 2009»
14 years 17 days ago
Self-Tuning, Bandwidth-Aware Monitoring for Dynamic Data Streams
— We present SMART, a self-tuning, bandwidth-aware monitoring system that maximizes result precision of continuous aggregate queries over dynamic data streams. While prior approa...
Navendu Jain, Praveen Yalagandula, Michael Dahlin,...