Sciweavers

1722 search results - page 62 / 345
» On the sample mean of graphs
Sort
View
100
Voted
COMBINATORICA
2007
148views more  COMBINATORICA 2007»
15 years 16 days ago
Colored graphs without colorful cycles
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
Richard N. Ball, Ales Pultr, Petr Vojtechovsk&yacu...
95
Voted
CVPR
2007
IEEE
16 years 2 months ago
Optimizing Distribution-based Matching by Random Subsampling
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
Alex Po Leung, Shaogang Gong
113
Voted
WSC
1989
15 years 1 months ago
Simulation run length planning
To design a stochastic simulation experiment, it is helpful to have an estimate of the simulation run lengths required to achieve desired statistical precision. Preliminary estima...
Ward Whitt
89
Voted
CSDA
2008
112views more  CSDA 2008»
15 years 19 days ago
Robustness of Fourier estimator of integrated volatility in the presence of microstructure noise
The finite sample properties of the Fourier estimator of integrated volatility under market microstructure noise are studied. Analytic expressions for the bias and the mean square...
M. E. Mancino, S. Sanfelici
GBRPR
2007
Springer
15 years 6 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke