Sciweavers

8431 search results - page 54 / 1687
» Algorithmically Independent Sequences
Sort
View
COMPGEOM
2005
ACM
14 years 11 months ago
Inclusion-exclusion formulas from independent complexes
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
Dominique Attali, Herbert Edelsbrunner
TC
1998
14 years 9 months ago
Resilient Authentication Using Path Independence
—Authentication using a path of trusted intermediaries, each able to authenticate the next in the path, is a well-known technique for authenticating channels in a large distribut...
Michael K. Reiter, Stuart G. Stubblebine
ICA
2004
Springer
15 years 3 months ago
Independent Slow Feature Analysis and Nonlinear Blind Source Separation
We present independent slow feature analysis as a new method for nonlinear blind source separation. It circumvents the indeterminacy of nonlinear independent component analysis by ...
Tobias Blaschke, Laurenz Wiskott
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
15 years 2 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert
SC
2003
ACM
15 years 3 months ago
A New Parallel Kernel-Independent Fast Multipole Method
We present a new adaptive fast multipole algorithm and its parallel implementation. The algorithm is kernel-independent in the sense that the evaluation of pairwise interactions do...
Lexing Ying, George Biros, Denis Zorin, Harper Lan...