Sciweavers

1346 search results - page 250 / 270
» On the number of rectangular partitions
Sort
View
INFOCOM
2005
IEEE
14 years 3 months ago
IPStash: a set-associative memory approach for efficient IP-lookup
—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased traffic, and higher speed links. These characteristics lead to the prevalence of hard...
Stefanos Kaxiras, Georgios Keramidas
INFOVIS
2005
IEEE
14 years 3 months ago
The Visual Code Navigator: An Interactive Toolset for Source Code Investigation
We present the Visual Code Navigator, a set of three interrelated visual tools that we developed for exploring large source code software projects from three different perspective...
Gerard Lommerse, Freek Nossin, Lucian Voinea, Alex...
ISCC
2005
IEEE
14 years 3 months ago
Optimizing the Reliable Distribution of Large Files within CDNs
Abstract Content Delivery Networks (CDNs) provide an efficient support for serving http and streaming media content while minimizing the network impact of content delivery as well...
Ludmila Cherkasova
CEEMAS
2005
Springer
14 years 3 months ago
The "Dance or Work" Problem: Why Do not all Honeybees Dance with Maximum Intensity
A honeybee colony has to choose among several nectar sources in the environment, each fluctuating in quality over time. Successful forager bees return to the hive and perform dance...
Ronald Thenius, Thomas Schmickl, Karl Crailsheim
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 3 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy