Sciweavers

2312 search results - page 64 / 463
» The complexity of estimating min-entropy
Sort
View
TCS
2010
13 years 4 months ago
Parametric random generation of deterministic tree automata
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain ...
SIGMETRICS
2000
ACM
111views Hardware» more  SIGMETRICS 2000»
13 years 9 months ago
AMVA techniques for high service time variability
Motivated by experience gained during the validation of a recent Approximate Mean Value Analysis (AMVA) model of modern shared memory architectures, this paper re-examines the &qu...
Derek L. Eager, Daniel J. Sorin, Mary K. Vernon
PRL
2010
105views more  PRL 2010»
13 years 8 months ago
Quasi-random nonlinear scale space
A novel nonlinear scale space framework is proposed for the purpose of multiscale image representation. The scale space decomposition problem is formulated as a general Bayesian l...
Akshaya Kumar Mishra, Alexander Wong, David A. Cla...
TSP
2010
13 years 4 months ago
A new parametric GLRT for multichannel adaptive signal detection
A parametric generalized likelihood ratio test (GLRT) for multichannel signal detection in spatially and temporally colored disturbance was recently introduced by modeling the dist...
Pu Wang, Hongbin Li, Braham Himed
IVC
2002
85views more  IVC 2002»
13 years 9 months ago
Multi-modal gray-level histogram modeling and decomposition
In this paper, we present a novel multi-modal histogram thresholding method in which no a priori knowledge about the number of clusters to be extracted is needed. The proposed met...
Jeng-Horng Chang, Kuo-Chin Fan, Yang-Lang Chang