505 search results - page 56 / 101 » Universal Constructions for Large Objects |
123
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
116
click to vote
SPAA
1990
ACM
15 years 8 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
155
click to vote
AIPS
2007
15 years 6 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
132
click to vote
TLDI
2005
ACM
15 years 9 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
135
click to vote
VISSOFT
2005
IEEE
15 years 9 months ago
2005
IEEE
Sequence diagrams are commonly used to represent object interactions in software systems. Reverse-engineered sequence diagrams, which are constructed from existing code, are becom...