2638 search results - page 365 / 528 » Random Geometric Complexes |
112
click to vote
EVOW
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we report on the synthesis of sounds using cellular automata, specifically the multitype voter model. The mapping process adopted is based on digital signal processin...
117
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
127
click to vote
CSR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
121
Voted
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
127
Voted
SSPR
1998
Springer
15 years 6 months ago
1998
Springer
: We present a practical approach to nonparametric cluster analysis of large data sets. The number of clusters and the cluster centres are automatically derived by mode seeking wit...