8699 search results - page 293 / 1740 » Elements of the Theory of Computation |
152
click to vote
ICRA
2005
IEEE
16 years 9 days ago
2005
IEEE
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...
147
click to vote
ISCAS
2005
IEEE
16 years 9 days ago
2005
IEEE
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...
159
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
181
click to vote
HUC
1999
Springer
15 years 11 months ago
1999
Springer
Systems must provide for mobile applications to be aware of the context in which they are being used. This is necessary to permit adaptation to heterogeneity of hosts and networks...
211
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...