43 search results - page 5 / 9 » Polynomial-time theory of matrix groups |
COMPGEOM
2010
ACM
14 years 17 days ago
2010
ACM
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
PADS
2004
ACM
14 years 28 days ago
2004
ACM
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
We present a framework for automatically summarizing social group activity over time. The problem is important in understanding large scale online social networks, which have dive...