Sciweavers

648 search results - page 36 / 130
» Lowness for Demuth Randomness
Sort
View
TON
2002
175views more  TON 2002»
14 years 9 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
PAMI
2007
176views more  PAMI 2007»
14 years 9 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
CORR
2000
Springer
95views Education» more  CORR 2000»
14 years 9 months ago
Effect of different packet sizes on RED performance
We consider the adaptation of random early detection (RED) as an active queue management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTU...
Stefaan De Cnodder, Omar Elloumi, Kenny Pauwels
TON
1998
63views more  TON 1998»
14 years 9 months ago
On variations of queue response for inputs with the same mean and autocorrelation function
— This paper explores the variations in mean queue length for stationary arrival processes with the same mean and autocorrelation functions, or equivalently, the same mean and po...
Bruce Hajek, Linhai He
TCAD
2002
128views more  TCAD 2002»
14 years 9 months ago
Preferred direction Steiner trees
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
Mehmet Can Yildiz, Patrick H. Madden