2638 search results - page 40 / 528 » Random Geometric Complexes |
EATCS
2002
15 years 1 months ago
2002
We explain the essence of K. Mulmuley and M. Sohoni, "Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems" [MS02] for a general complexity-the...
110
click to vote
TCS
2002
15 years 1 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
110
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
This paper considers the decomposition of a complex matrix as the product of several sets of semi-unitary matrices and upper triangular matrices in iterative manner. The inner mos...
129
click to vote
FAW
2009
Springer
15 years 8 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
114
click to vote
CCS
2001
ACM
15 years 6 months ago
2001
ACM
We propose a novel and robust hashing paradigm that uses iterative geometric techniques and relies on observations that main geometric features within an image would approximately ...