Sciweavers

1538 search results - page 248 / 308
» Relative Randomness and Cardinality
Sort
View
TJS
2008
95views more  TJS 2008»
14 years 9 months ago
Combating I-O bottleneck using prefetching: model, algorithms, and ramifications
Multiple memory models have been proposed to capture the effects of memory hierarchy culminating in the I-O model of Aggarwal and Vitter [?]. More than a decade of architectural a...
Akshat Verma, Sandeep Sen
TVLSI
2008
151views more  TVLSI 2008»
14 years 9 months ago
Guest Editorial Special Section on Design Verification and Validation
ion levels. The framework also supports the generation of test constraints, which can be satisfied using a constraint solver to generate tests. A compositional verification approac...
I. Harris, D. Pradhan
CVIU
2004
143views more  CVIU 2004»
14 years 9 months ago
Shape matching of partially occluded curves invariant under projective transformation
This paper describes a method to identify partially occluded shapes which are randomly oriented in 3D space. The goal is to match the object contour present in an image with an ob...
Carlos Orrite, José Elías Herrero Ja...
CN
2002
102views more  CN 2002»
14 years 9 months ago
Predicting bottleneck bandwidth sharing by generalized TCP flows
The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottlene...
Archan Misra, Teunis J. Ott, John S. Baras
CORR
2002
Springer
123views Education» more  CORR 2002»
14 years 9 months ago
Survey propagation: an algorithm for satisfiability
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
Alfredo Braunstein, Marc Mézard, Riccardo Z...