15792 search results - page 274 / 3159 » Computational Abstraction Steps |
203
click to vote
TIP
2002
15 years 7 months ago
2002
Abstract--We propose an approach to accurately detecting twodimensional (2-D) shapes. The cross section of the shape boundary is modeled as a step function. We first derive a one-d...
205
click to vote
WDAG
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We argue that failure detectors encapsulate fairness. Fairness is a measure of the number of steps a process takes relative to another processes and/or messages in transi...
175
click to vote
GG
2008
Springer
15 years 8 months ago
2008
Springer
A variety of computation models have been developed using graphs and graph transformations. These include models for sequential, distributed, parallel or mobile computation. A grap...
214
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
152
click to vote
LICS
2005
IEEE
16 years 26 days ago
2005
IEEE
We construct a domain-theoretic calculus for Lipschitz and differentiable functions, which includes addition, subtraction and composition. We then develop a domaintheoretic versio...