590 search results - page 44 / 118 » Resolution-stationary random number generators |
142
click to vote
ICRA
2003
IEEE
15 years 9 months ago
2003
IEEE
— One of the fundamental problems of the mobile robots is self-localization, i.e. to estimate the self-position by comparing sensor data and a map. In non-stationary environments...
116
click to vote
ISCAS
2003
IEEE
15 years 9 months ago
2003
IEEE
A deterministic dynamic element matching (DEM) approach to ADC testing is introduced and compared with a common random DEM method. With both approaches, a highly non-ideal DAC is ...
177
click to vote
JCB
2002
15 years 4 months ago
2002
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
140
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
136
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...