628 search results - page 114 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
EUROGP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. This paper explores distance measures based on genetic operators for genetic programming using tree structures. The consistency between genetic operators and distance mea...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
127
click to vote
SDM
2012
SIAM
13 years 2 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
83
Voted
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
101
click to vote
STOC
2009
ACM
16 years 10 days ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...