Sciweavers

2950 search results - page 573 / 590
» Computing with Infinitely Many Processes
Sort
View
COMPGEOM
2010
ACM
14 years 20 days ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
ICPR
2002
IEEE
14 years 16 days ago
Virtual Audio System Customization Using Visual Matching of Ear Parameters
Applications in the creation of virtual auditory spaces (VAS) and sonification require individualized head related transfer functions (HRTFs) for perceptual fidelity. HRTFs exhi...
Dmitry N. Zotkin, Ramani Duraiswami, Larry S. Davi...
COMPSAC
2009
IEEE
14 years 9 days ago
Towards a Next-Generation Matrix Library for Java
Matrices are essential in many fields of computer science, especially when large amounts of data must be handled efficiently. Despite this demand for matrix software, we were una...
Holger Arndt, Markus Bundschus, Andreas Naegele
DAC
2009
ACM
14 years 8 days ago
Vicis: a reliable network for unreliable silicon
Process scaling has given designers billions of transistors to work with. As feature sizes near the atomic scale, extensive variation and wearout inevitably make margining unecono...
David Fick, Andrew DeOrio, Jin Hu, Valeria Bertacc...
AC
1999
Springer
13 years 12 months ago
The University Student Registration System: A Case Study in Building a High-Availability Distributed Application Using General P
Prior to 1994, student registration at Newcastle University involved students being registered in a single place, where they would present a form which had previously been filled ...
Mark C. Little, Stuart M. Wheater, David B. Ingham...