2638 search results - page 130 / 528 » Random Geometric Complexes |
141
click to vote
FOCS
1997
IEEE
15 years 9 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
134
Voted
WSC
2001
15 years 6 months ago
2001
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
132
click to vote
ENTCS
2007
15 years 4 months ago
2007
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
155
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
We address the problem of academic conference homepage understanding for the Semantic Web. This problem consists of three labeling tasks - labeling conference function pages, func...
125
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...