4377 search results - page 726 / 876 » Mass problems and randomness |
110
click to vote
CIAC
1994
Springer
15 years 2 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
ISSTA
1993
ACM
15 years 2 months ago
1993
ACM
Most of the effort that goes into improving the quality of software paradoxically does not lead to quantitative, measurable quality. Software developers and quality-assurance orga...
PODC
1990
ACM
15 years 2 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
3DIM
2007
IEEE
15 years 2 months ago
2007
IEEE
An algorithm is presented to estimate the position of a hand-held camera with respect to a 3d world model constructed from range data and color imagery. Little prior knowledge is ...
ANCS
2007
ACM
15 years 2 months ago
2007
ACM
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...