451 search results - page 50 / 91 » Relationless Completeness and Separations |
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
A heretofore unsolved problem of great archaeological importance is the automatic assembly of pots made on a wheel from the hundreds (or thousands) of sherds found at an excavatio...
164
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
176
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
C++ templates are key to the design of current successful mainstream libraries and systems. They are the basis of programming techniques in diverse areas ranging from conventional...
ISSTA
2009
ACM
15 years 4 months ago
2009
ACM
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...