Sciweavers

140 search results - page 18 / 28
» Doing More with Fewer Bits
Sort
View
CCS
2011
ACM
12 years 7 months ago
Forensic investigation of the OneSwarm anonymous filesharing system
OneSwarm is a system for anonymous p2p file sharing in use by thousands of peers. It aims to provide Onion Routing-like privacy and BitTorrent-like performance. We demonstrate se...
Swagatika Prusty, Brian Neil Levine, Marc Liberato...
ANCS
2009
ACM
13 years 5 months ago
Range Tries for scalable address lookup
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...
Ioannis Sourdis, Georgios Stefanakis, Ruben de Sme...
SAMOS
2004
Springer
14 years 26 days ago
Scalable Instruction-Level Parallelism.
This paper presents a model for instruction-level distributed computing that allows the implementation of scalable chip multiprocessors. Based on explicit microthreading it serves ...
Chris R. Jesshope
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
14 years 4 months ago
Deletion Without Rebalancing in Balanced Binary Trees
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
Siddhartha Sen, Robert E. Tarjan
CEC
2010
IEEE
13 years 8 months ago
Evolving programs with parameters and loops
At the current state of the art, genetic programs do not contain two constructs that commonly occur in programs written by humans, that is, loops and functions with parameters. In ...
Gayan Wijesinghe, Victor Ciesielski