Sciweavers

194 search results - page 39 / 39
» Computing Roundness is Easy if the Set is Almost Round
Sort
View
PPOPP
2012
ACM
12 years 10 days ago
Chestnut: a GPU programming language for non-experts
Graphics processing units (GPUs) are powerful devices capable of rapid parallel computation. GPU programming, however, can be quite difficult, limiting its use to experienced prog...
Andrew Stromme, Ryan Carlson, Tia Newhall
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
14 years 4 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
13 years 10 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
ASSETS
2010
ACM
12 years 11 months ago
Broadening accessibility through special interests: a new approach for software customization
Individuals diagnosed with autism spectrum disorder (ASD) often fixate on narrow, restricted interests. These interests can be highly motivating, but they can also create attentio...
Robert R. Morris, Connor R. Kirschbaum, Rosalind W...