3946 search results - page 72 / 790 » The computational complexity of choice sets |
CORR
2006
Springer
14 years 12 months ago
2006
Springer
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
We present a case study to demonstrate the possibility of discovering complex and interesting latent structures using hierarchical latent class (HLC) models. A similar effort was m...
162
click to vote
HPDC
1993
IEEE
1993
IEEE
An Analysis of Distributed Computing Software and Hardware for Applications in Computational Physics
15 years 4 months ago
We have implemented a set of computational physics codes on a network of IBM RS/6000 workstations used as a distributed parallel computer. We compare the performance of the codes ...
KDD
2004
ACM
16 years 7 days ago
2004
ACM
The computation of covariance and correlation matrices are critical to many data mining applications and processes. Unfortunately the classical covariance and correlation matrices...
142
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...