2553 search results - page 319 / 511 » Modeling Trees with Hypertextures |
138
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
141
Voted
XSYM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The extensible markup language XML has become the de facto standard for information representation and interchange on the Internet. XML parsing is a core operation perfor...
139
Voted
CDVE
2007
Springer
15 years 9 months ago
2007
Springer
In order to build complex, large-scale, dependable systems it is necessary to use a development environment with an integrated set of capabilities that supports editing and formal...
147
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
147
Voted
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...