1809 search results - page 93 / 362 » Weakly Computable Real Numbers |
155
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
161
click to vote
IJNSEC
2010
14 years 10 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
154
click to vote
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
120
Voted
DCOSS
2007
Springer
15 years 8 months ago
2007
Springer
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
132
click to vote
NC
1998
15 years 5 months ago
1998
Many processes are composed of a n-fold repetition of some simpler process. If the whole process can be modeled with a neural network, we present a method to derive a model of the...