6111 search results - page 14 / 1223 » Time, Hardware, and Uniformity |
191
Voted
CPC
2006
15 years 7 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
209
Voted
JMLR
2012
13 years 10 months ago
2012
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
138
Voted
CG
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we introduce a new approach to line drawing that attempts to maintain a uniform packing density of horizontal segments to diagonal segments throughout the line. Whi...
232
Voted
ICALP
2003
Springer
16 years 19 days ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
210
Voted
COLT
2008
Springer
15 years 9 months ago
2008
Springer
We show that randomly generated monotone c log(n)-DNF formula can be learned exactly in probabilistic polynomial time. Our notion of randomly generated is with respect to a unifor...