11214 search results - page 1901 / 2243 » Just-in-time data structures |
181
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
178
click to vote
ASUNAM
2009
IEEE
16 years 1 months ago
2009
IEEE
—This paper presents a novel methodology for social network discovery based on the sensitivity coefficients of importance metrics, namely the Markov centrality of a node, a metr...
201
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
201
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— Existing stream processing systems are optimized for a specific metric, which may limit their applicability to diverse applications and environments. This paper presents XFlow...
121
click to vote
ISBI
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we present and study two local features for the tracking of vascular structures on 3D angiograms. The first one, Flux, measures the inward gradient flux through c...