Sciweavers

1618 search results - page 107 / 324
» Testing random number generators
Sort
View
MICS
2010
134views more  MICS 2010»
13 years 8 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
ECCV
2010
Springer
14 years 3 months ago
Randomized Locality Sensitive Vocabularies for Bag-of-Features Model
Abstract. Visual vocabulary construction is an integral part of the popular Bag-of-Features (BOF) model. When visual data scale up (in terms of the dimensionality of features or/an...
RSA
2002
99views more  RSA 2002»
13 years 9 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 10 months ago
Channel Estimation for Opportunistic Spectrum Access: Uniform and Random Sensing
The knowledge of channel statistics can be very helpful in making sound opportunistic spectrum access decisions. It is therefore desirable to be able to efficiently and accurately...
Quanquan Liang, Mingyan Liu
ICST
2010
IEEE
13 years 8 months ago
Fault Detection Likelihood of Test Sequence Length
— Testing of graphical user interfaces is important due to its potential to reveal faults in operation and performance of the system under consideration. Most existing test appro...
Fevzi Belli, Michael Linschulte, Christof J. Budni...