Sciweavers

713 search results - page 129 / 143
» Saving Space by Algebraization
Sort
View
INFOCOM
2005
IEEE
15 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
SIGMETRICS
2003
ACM
130views Hardware» more  SIGMETRICS 2003»
15 years 3 months ago
Analysis of TCP's computational energy cost for mobile computing
In this paper we present results from a detailed measurement study of TCP (Transmission Control Protocol) running over a wireless link. Our primary goal was on obtaining a breakdo...
Bokyung Wang, Suresh Singh
ADC
2003
Springer
123views Database» more  ADC 2003»
15 years 3 months ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li
SIGMOD
1999
ACM
108views Database» more  SIGMOD 1999»
15 years 2 months ago
DynaMat: A Dynamic View Management System for Data Warehouses
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
Yannis Kotidis, Nick Roussopoulos
ACMMSP
2006
ACM
226views Hardware» more  ACMMSP 2006»
15 years 1 months ago
Smarter garbage collection with simplifiers
We introduce a method for providing lightweight daemons, called simplifiers, that attach themselves to program data. If a data item has a simplifier, the simplifier may be run aut...
Melissa E. O'Neill, F. Warren Burton