Sciweavers

3267 search results - page 433 / 654
» Generalized quasirandom graphs
Sort
View
CHI
2007
ACM
16 years 7 months ago
An initial investigation into non-visual computer supported collaboration
In this paper we present an initial study of computer supported collaboration between visually impaired users based around the interactive browsing and manipulation of simple grap...
David K. McGookin, Stephen A. Brewster
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 7 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 6 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
ICSE
2007
IEEE-ACM
16 years 6 months ago
SoftGUESS: Visualization and Exploration of Code Clones in Context
We introduce SoftGUESS, a code clone exploration system. SoftGUESS is built on the more general GUESS system which provides users with a mechanism to interactively explore graph s...
Eytan Adar, Miryung Kim
DCC
2004
IEEE
16 years 6 months ago
LDPC Codes from Triangle-Free Line Sets
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles a...
Keith E. Mellinger