2430 search results - page 328 / 486 » Computing Tutte Polynomials |
148
click to vote
COLT
2006
Springer
15 years 7 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
137
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
128
Voted
GLVLSI
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper, we present an approved linear-time algorithm for statistical leakage analysis in the present of any spatial correlation condition (strong or weak). The new algorith...
138
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
133
Voted
ALGORITHMICA
1998
15 years 3 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...