1801 search results - page 32 / 361 » Pointing without a pointer |
CC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present a formal description of data slicing, which is a type-directed program transformation technique that separates a program’s heap into several independent...
SIGMETRICS
2004
ACM
14 years 1 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
VLDB
1990
ACM
13 years 12 months ago
1990
ACM
Jasmine/C is a C-based database proqramninq language that allows the handling of persistent objects in Jasmine databases. The language is used to write methods for objects and app...
ICPR
2010
IEEE
13 years 6 months ago
2010
IEEE
In this paper we introduce a robust matching technique that allows to operate a very accurate selection of corresponding feature points from multiple views. Robustness is achieved...
TIT
2002
13 years 7 months ago
2002
In this semitutorial paper, a comprehensive survey of closest point search methods for lattices without a regular structure is presented. The existing search strategies are describ...