32545 search results - page 426 / 6509 » Data Structures and Algorithms |
154
click to vote
SSPR
2004
Springer
16 years 9 days ago
2004
Springer
In this paper we present a symbols recognition system for graphic documents, based on a combination of global structural approaches. Our system allows to extract components and the...
157
click to vote
LICS
2002
IEEE
15 years 12 months ago
2002
IEEE
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative pr...
159
click to vote
PODC
2003
ACM
16 years 6 days ago
2003
ACM
We propose a new form of software transactional memory (STM) designed to support dynamic-sized data structures, and we describe a novel non-blocking implementation. The non-blocki...
229
click to vote
COCOON
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
227
click to vote
IEEEPACT
2009
IEEE
15 years 4 months ago
2009
IEEE
As the gap between processor and memory continues to grow, memory performance becomes a key performance bottleneck for many applications. Compilers therefore increasingly seek to m...