Sciweavers

5606 search results - page 505 / 1122
» Randomization Techniques for Graphs.
Sort
View
COMBINATORICS
1998
76views more  COMBINATORICS 1998»
15 years 6 months ago
An Exploration of the Permanent-Determinant Method
The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kaste...
Greg Kuperberg
ICDE
2006
IEEE
142views Database» more  ICDE 2006»
16 years 8 months ago
End-biased Samples for Join Cardinality Estimation
We present a new technique for using samples to estimate join cardinalities. This technique, which we term "end-biased samples," is inspired by recent work in network tr...
Cristian Estan, Jeffrey F. Naughton
RTAS
2007
IEEE
16 years 1 months ago
Stochastic Metrics for Debugging the Timing Behaviour of Real-Time Systems
Stochastic analysis techniques for real-time systems model the execution time of tasks as random variables. These techniques constitute a very powerful tool to study the behaviour...
Joaquín Entrialgo, Javier García, Jo...
COMPSAC
2006
IEEE
16 years 28 days ago
On the Distribution of Property Violations in Formal Models: An Initial Study
Model-checking techniques are successfully used in the verification of both hardware and software systems of industrial relevance. Unfortunately, the capability of current techni...
Jimin Gao, Mats Per Erik Heimdahl, David Owen, Tim...
CANS
2005
Springer
120views Cryptology» more  CANS 2005»
16 years 12 days ago
The Second-Preimage Attack on MD4
In Eurocrypt’05, Wang et al. presented new techniques to find collisions of Hash function MD4. The techniques are not only efficient to search for collisions, but also applicabl...
Hongbo Yu, Gaoli Wang, Guoyan Zhang, Xiaoyun Wang