2479 search results - page 164 / 496 » Quantum complexity theory |
159
click to vote
HICSS
2008
IEEE
16 years 1 months ago
2008
IEEE
Research has shown that decentralized networks and organizations perform better and have more satisfied members than centralized ones. Further, decentralized self-organizing netwo...
191
click to vote
LFCS
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
237
click to vote
JDCTA
2010
15 years 1 months ago
2010
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
225
click to vote
STOC
1996
ACM
15 years 11 months ago
1996
ACM
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
124
click to vote
SIAMMAX
2010
15 years 1 months ago
2010
Abstract. We discuss the notion of irreducible block Schur decomposition of a complex square matrix and show how such a decomposition provides information about singularities in th...