2766 search results - page 410 / 554 » Algorithms for trigonometric polynomials |
137
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
139
click to vote
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...
122
click to vote
ICGI
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
136
click to vote
COLT
2010
Springer
15 years 2 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...
173
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...