Sciweavers

432 search results - page 32 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
INFOCOM
2010
IEEE
14 years 11 months ago
Optimal Control of Wireless Networks with Finite Buffers
This paper considers network control for wireless networks with finite buffers. We investigate the performance of joint flow control, routing, and scheduling algorithms which achie...
Long Bao Le, Eytan Modiano, Ness B. Shroff
182
Voted
CRYPTO
1999
Springer
159views Cryptology» more  CRYPTO 1999»
15 years 6 months ago
UMAC: Fast and Secure Message Authentication
We describe a message authentication algorithm, UMAC, which can authenticate messages (in software, on contemporary machines) roughly an order of magnitude faster than current prac...
John Black, Shai Halevi, Hugo Krawczyk, Ted Krovet...
ICPPW
2009
IEEE
15 years 8 months ago
Fast Autotuning Configurations of Parameters in Distributed Computing Systems Using Ordinal Optimization
Conventional autotuning configuration of parameters in distributed computing systems using evolutionary strategies increases integrated performance notably, though at the expense ...
Fan Zhang, Junwei Cao, Lianchen Liu, Cheng Wu
KAIS
2006
126views more  KAIS 2006»
15 years 1 months ago
Fast and exact out-of-core and distributed k-means clustering
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
Ruoming Jin, Anjan Goswami, Gagan Agrawal
TCAD
2002
146views more  TCAD 2002»
15 years 1 months ago
Static scheduling of multidomain circuits for fast functional verification
With the advent of system-on-a-chip design, many application specific integrated circuits (ASICs) now require multiple design clocks that operate asynchronously to each other. This...
Murali Kudlugi, Russell Tessier