Sciweavers

2028 search results - page 392 / 406
» Deriving Relation Keys from XML Keys
Sort
View
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 3 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
162
Voted
SIGIR
1992
ACM
15 years 3 months ago
Bead: Explorations in Information Visualization
ct We describe work on the visualization of bibliographic data and, to aid in this task, the application of numerical techniques for multidimensional scaling. Many areas of scienti...
Matthew Chalmers, Paul Chitson
QOSA
2010
Springer
15 years 3 months ago
Validating Model-Driven Performance Predictions on Random Software Systems
Abstract. Software performance prediction methods are typically validated by taking an appropriate software system, performing both performance predictions and performance measurem...
Vlastimil Babka, Petr Tuma, Lubomír Bulej
FCCM
2007
IEEE
122views VLSI» more  FCCM 2007»
15 years 3 months ago
Reconfigurable Computing Cluster (RCC) Project: Investigating the Feasibility of FPGA-Based Petascale Computing
While medium- and large-sized computing centers have increasingly relied on clusters of commodity PC hardware to provide cost-effective capacity and capability, it is not clear th...
Ron Sass, William V. Kritikos, Andrew G. Schmidt, ...
CGO
2004
IEEE
15 years 3 months ago
A Dynamically Tuned Sorting Library
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...
Xiaoming Li, María Jesús Garzar&aacu...