Sciweavers

2104 search results - page 114 / 421
» Sorting with networks of data structures
Sort
View
CHI
2010
ACM
15 years 11 months ago
Avaaj Otalo: a field study of an interactive voice forum for small farmers in rural India
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...
Neil Patel, Deepti Chittamuru, Anupam Jain, Paresh...
CASC
2007
Springer
112views Mathematics» more  CASC 2007»
15 years 10 months ago
Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...
Michael B. Monagan, Roman Pearce
IV
2005
IEEE
130views Visualization» more  IV 2005»
15 years 10 months ago
A Comparison of Visual and Haptic Object Representations Based on Similarity
Do we judge similarity between two objects to be the same using touch and vision? We investigated this using psychophysical experiments in which subjects rated the similarity betw...
Theresa Cooke, Christian Wallraven, Heinrich H. B&...
VLDB
1994
ACM
129views Database» more  VLDB 1994»
15 years 8 months ago
Hilbert R-tree: An Improved R-tree using Fractals
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
Ibrahim Kamel, Christos Faloutsos
SODA
1998
ACM
98views Algorithms» more  SODA 1998»
15 years 5 months ago
Finger Search Trees with Constant Insertion Time
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
Gerth Stølting Brodal