1456 search results - page 73 / 292 » Improved Randomized Results for That Interval Selection Prob... |
114
click to vote
RSA
2010
14 years 9 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
100
click to vote
IWCMC
2010
ACM
15 years 1 months ago
2010
ACM
Despite a large body of literature and methods devoted to the Traffic Matrix (TM) estimation problem, the inference of traffic flows volume from aggregated data still represents a ...
CLEF
2010
Springer
14 years 11 months ago
2010
Springer
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
ICCD
1997
IEEE
15 years 3 months ago
1997
IEEE
: This paper studies pseudo-random pattern testing of bridging faults. Although bridging faults are generally more random pattern testable than stuck-at faults, examples are shown ...
DCOSS
2008
Springer
15 years 1 months ago
2008
Springer
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...