494 search results - page 35 / 99 » Heap Building Bounds |
ENTCS
2002
14 years 11 months ago
2002
Petri nets where, to my knowledge, the first theoretical model augmented with time constraints [Mer74], and the support of the first reachability algorithm of timed system [BM83, ...
VLDB
1995
ACM
15 years 2 months ago
1995
ACM
The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, R-tree, R+-tree, and the PMR quadtree. The focus is on a spatia...
DAGM
2009
Springer
15 years 5 months ago
2009
Springer
Although edge detection is a well investigated topic, 3D edge detectors mostly lack either accuracy or speed. We will show, how to build a highly accurate subvoxel edge detector, w...
100
click to vote
SAC
2006
ACM
15 years 5 months ago
2006
ACM
Parameterization is an effective technique for building flexible, reusable software. When dealing with parameterized components, an important concern is the time at which parame...
95
Voted
GD
2004
Springer
15 years 4 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...