1722 search results - page 27 / 345 » On the sample mean of graphs |
MFCS
2007
Springer
15 years 4 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Effective access to and navigation in information stored in deep Web ontological repositories or relational databases has yet to be realized due to issues with usability of user i...
SODA
2007
ACM
14 years 11 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
ENVSOFT
2007
14 years 10 months ago
2007
The SISSI program implements a novel approach for the estimation of the optimal sample size in experimental data collection. It provides avisual evaluation system of sample size d...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
In this paper, we study a simple correlation-based strategy for estimating the unknown delay and amplitude of a signal based on a small number of noisy, randomly chosen frequency-...