11211 search results - page 1628 / 2243 » Rank-Sensitive Data Structures |
178
click to vote
ICSE
2000
IEEE-ACM
15 years 11 months ago
2000
IEEE-ACM
In this article we summarize the strengths and weaknesses of empirical research in software engineering. We argue that in order to improve the current situation we must create bet...
208
click to vote
ISN
2000
Springer
15 years 11 months ago
2000
Springer
The demand for a great variety of sophisticated telecommunications services with multimedia characteristics is increasing. This trend highlights the need for the efficient creation...
192
click to vote
IWMM
2000
Springer
15 years 11 months ago
2000
Springer
This paper explains a technique that integrates conservative garbage collection on top of general memory allocators. This is possible by using two data structures named malloc-tab...
195
click to vote
PODS
2000
ACM
15 years 11 months ago
2000
ACM
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
182
click to vote
RELMICS
2000
Springer
15 years 11 months ago
2000
Springer
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...