Sciweavers

4944 search results - page 742 / 989
» From XML to Relational Models
Sort
View
BMVC
2002
15 years 6 months ago
Randomized RANSAC with T(d, d) test
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
Jiri Matas, Ondrej Chum
USENIX
2008
15 years 6 months ago
Evaluating Distributed Systems: Does Background Traffic Matter?
Evaluating novel networked protocols and services requires subjecting the target system to realistic Internet conditions. However, there is no common understanding of what is requ...
Kashi Venkatesh Vishwanath, Amin Vahdat
131
Voted
WSC
2007
15 years 6 months ago
Agile optimization for coercion
Coercion combines flexible points, semi-automated optimization and expert guided manual code modification for adapting simulations to meet new requirements. Coercion can improve s...
Lingjia Tang, Paul F. Reynolds Jr.
WSC
2008
15 years 6 months ago
Skart: A skewness- and autoregression-adjusted batch-means procedure for simulation analysis
We discuss Skart, an automated batch-means procedure for constructing a skewness- and autoregression-adjusted confidence interval for the steady-state mean of a simulation output ...
Ali Tafazzoli, James R. Wilson, Emily K. Lada, Nat...
ASIACRYPT
2008
Springer
15 years 6 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...