419 search results - page 6 / 84 » Succincter |
ICDAR
2007
IEEE
15 years 3 months ago
2007
IEEE
We model on-line ink traces for a set of 219 symbols to “best fit” low-degree polynomial series. Using a collection of mathematical writing samples, we find that in many cas...
DBPL
2007
Springer
15 years 3 months ago
2007
Springer
Martens et al. defined a pattern-based specification language equivalent in expressive power to the widely adopted XML Schema definitions (XSDs). This language consists of rules...
GD
2008
Springer
14 years 10 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...