11231 search results - page 1873 / 2247 » Digging for Data Structures |
124
click to vote
CICLING
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Child language acquisition, one of Nature’s most fascinating phenomena, is to a large extent still a puzzle. Experimental evidence seems to support the view that early ...
130
click to vote
LATIN
2010
Springer
15 years 11 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...
141
click to vote
ASUNAM
2009
IEEE
15 years 11 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...
160
click to vote
ICDE
2009
IEEE
15 years 11 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...
159
click to vote
ICDE
2009
IEEE
15 years 11 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...