11211 search results - page 1921 / 2243 » Rank-Sensitive Data Structures |
118
click to vote
CHI
2010
ACM
15 years 10 months ago
2010
ACM
In this paper we present the results of a field study of Avaaj Otalo (literally, “voice stoop”), an interactive voice application for small-scale farmers in Gujarat, India. T...
136
click to vote
SAC
2010
ACM
15 years 10 months ago
2010
ACM
This paper presents the Referrer Graph (RG) web prediction algorithm as a low-cost solution to predict next web user accesses. RG is aimed at being used in a real web system with ...
121
click to vote
CICLING
2010
Springer
15 years 10 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 ...
126
Voted
LATIN
2010
Springer
15 years 10 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...
135
click to vote
ASUNAM
2009
IEEE
15 years 10 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...