226 search results - page 28 / 46 » A Tutorial on Analog Computation: Computing Functions over t... |
133
click to vote
OTM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. A significant increase in real world event monitoring capability with wireless sensor networks brought a new challenge to ubiquitous computing. To manage high volume and...
115
click to vote
ADC
1999
Springer
15 years 8 months ago
1999
Springer
We introduce a cost model for the M-tree access method [Ciaccia et al., 1997] which provides estimates of CPU (distance computations) and I/O costs for the execution of similarity ...
128
click to vote
STOC
1992
ACM
15 years 8 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
136
click to vote
TFS
2008
15 years 3 months ago
2008
Generalised type-2 fuzzy logic systems can not currently be used for practical problems because the amount of computation required to defuzzify a generalised type-2 fuzzy set is to...
106
click to vote
CSDA
2007
15 years 3 months ago
2007
Many probabilistic models are only defined up to a normalization constant. This makes maximum likelihood estimation of the model parameters very difficult. Typically, one then h...