36 search results - page 5 / 8 » The Universal Resolving Algorithm: Inverse Computation in a ... |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
JCC
2008
13 years 7 months ago
2008
Abstract: We have developed a fitting algorithm able to extract spectral and dynamic properties of a three level oscillator from a two-dimensional infrared spectrum (2D-IR) detecte...
TASE
2008
IEEE
13 years 7 months ago
2008
IEEE
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
STOC
1998
ACM
13 years 12 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...