2492 search results - page 286 / 499 » On the General Signature Trees |
160
click to vote
ICTAC
2004
Springer
15 years 11 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
218
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
168
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
225
click to vote
TMI
2010
15 years 25 days ago
2010
Abstract--This work provides a model for tubular structures, and devises an algorithm to automatically extract tubular anatomical structures from medical imagery. Our model fits ma...
151
click to vote
ASPLOS
2012
ACM
14 years 1 months ago
2012
ACM
Traditional storage systems provide a simple read/write interface, which is inadequate for low-locality update-intensive workloads because it limits the disk scheduling flexibili...