272 search results - page 29 / 55 » Lazy tree splitting |
157
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
168
click to vote
PLILP
1992
Springer
15 years 10 months ago
1992
Springer
Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The "programs" in this language take text or parse trees as input an...
132
click to vote
DKE
2008
15 years 6 months ago
2008
Handling missing data is a critical step to ensuring good results in data mining. Like most data mining algorithms, existing privacy-preserving data mining algorithms assume data ...
135
click to vote
JGT
2007
15 years 5 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
193
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...