Sciweavers

411 search results - page 42 / 83
» Efficient View Maintenance Using Version Numbers
Sort
View
87
Voted
COCOON
2006
Springer
15 years 1 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
ICSE
2000
IEEE-ACM
15 years 1 months ago
An empirical study of regression test application frequency
Regression testing is an expensive maintenance process used to revalidate modified software. Regression test selection (RTS) techniques attempt to reduce the cost of regression te...
Jung-Min Kim, Adam A. Porter, Gregg Rothermel
INFOCOM
1992
IEEE
15 years 1 months ago
An Assessment of State and Lookup Overhead in Routers
The current Internet is based on a stateless (datagram) architecture. However, many recent proposals rely on the maintenance of state information within network routers, leading t...
Deborah Estrin, Danny J. Mitzel
61
Voted
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
15 years 10 months ago
Non-interactive and reusable non-malleable commitment schemes
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
Ivan Damgård, Jens Groth
SIGMETRICS
2008
ACM
14 years 9 months ago
DRAM is plenty fast for wirespeed statistics counting
Per-flow network measurement at Internet backbone links requires the efficient maintanence of large arrays of statistics counters at very high speeds (e.g. 40 Gb/s). The prevailin...
Bill Lin, Jun (Jim) Xu