4516 search results - page 507 / 904 » Data Structures in the Design of Interfaces |
211
click to vote
COMPGEOM
2004
ACM
16 years 8 days ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
169
click to vote
VR
1999
IEEE
15 years 11 months ago
1999
IEEE
We have created an immersive application for statistical graphics and have investigated what benefits it offers over more traditional data analysis tools. This paper presents a de...
176
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
165
click to vote
SPAA
2005
ACM
16 years 12 days ago
2005
ACM
This paper shows for the first time that elimination, a scaling technique formerly applied only to counters and LIFO structures, can be applied to FIFO data structures, specific...
164
click to vote
CC
2003
Springer
16 years 2 days ago
2003
Springer
We have developed Tm, a template-based metacompiler. Given a set of data-structure definitions and a template, Tm generates files that instantiate the template for the given data...