187 search results - page 25 / 38 » On the uniform edge-partition of a tree |
125
click to vote
CPM
2004
Springer
15 years 2 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
82
Voted
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
As databases become more pervasive through the biological sciences, various data quality issues regarding data legacy, data uniformity and data duplication arise. Due to the natur...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Several different controller representations are compared on a non-trivial problem in simulated car racing, with respect to learning speed and final fitness. The controller rep...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...