3680 search results - page 341 / 736 » cases 2010 |
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...
168
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The present lack of a stable method to compare persistent homology groups with torsion is a relevant problem in current research about Persistent Homology and its applications in P...
217
click to vote
DMTCS
2010
15 years 4 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
196
Voted
DMTCS
2010
15 years 4 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
159
click to vote
EC
2010
15 years 4 months ago
2010
A genetic algorithm is invariant with respect to a set of representations if it runs the same no matter which of the representations is used. We formalize this concept mathematica...