Sciweavers

215 search results - page 24 / 43
» On the number of factorizations of a full cycle
Sort
View
ANCS
2009
ACM
14 years 9 months ago
Progressive hashing for packet processing using set associative memory
As the Internet grows, both the number of rules in packet filtering databases and the number of prefixes in IP lookup tables inside the router are growing. The packet processing e...
Michel Hanna, Socrates Demetriades, Sangyeun Cho, ...
SAC
2010
ACM
14 years 12 months ago
Improving the efficiency of dynamic malware analysis
Each day, security companies see themselves confronted with thousands of new malware programs. To cope with these large quantities, researchers and practitioners alike have develo...
Ulrich Bayer, Engin Kirda, Christopher Kruegel
RSA
1998
93views more  RSA 1998»
14 years 11 months ago
Parallel randomized load balancing
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
Micah Adler, Soumen Chakrabarti, Michael Mitzenmac...
SC
1995
ACM
15 years 3 months ago
Analysis of Multilevel Graph Partitioning
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
George Karypis, Vipin Kumar
ICALP
2010
Springer
15 years 4 months ago
Additive Spanners in Nearly Quadratic Time
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
David P. Woodruff