Sciweavers

287 search results - page 28 / 58
» On the Complexity of Register Coalescing
Sort
View
CPHYSICS
2007
71views more  CPHYSICS 2007»
13 years 7 months ago
Simulation of n-qubit quantum systems. III. Quantum operations
During the last decade, several quantum information protocols, such as quantum key distribution, teleportation or quantum computation, have attracted a lot of interest. Despite th...
T. Radtke, S. Fritzsche
ICCV
2003
IEEE
14 years 9 months ago
Surface Reflectance Modeling of Real Objects with Interreflections
In mixed reality, especially in augmented virtuality which virtualizes real objects, it is important to estimate object surface reflectance properties to render the objects under ...
Takashi Machida, Naokazu Yokoya, Haruo Takemura
ICCD
2003
IEEE
147views Hardware» more  ICCD 2003»
14 years 4 months ago
An Efficient VLIW DSP Architecture for Baseband Processing
The VLIW processors with static instruction scheduling and thus deterministic execution times are very suitable for highperformance real-time DSP applications. But the two major w...
Tay-Jyi Lin, Chin-Chi Chang, Chen-Chia Lee, Chein-...
IEEEARES
2008
IEEE
14 years 2 months ago
A Secure and Scalable Infrastructure for Inter-Organizational Data Exchange and eGovernment Applications
As more and more information becomes accessible via on-line databases, more public services can be provided and more complex queries involving several registers become feasible as...
Jan Willemson, Arne Ansper
TLCA
2007
Springer
14 years 1 months ago
Predicative Analysis of Feasibility and Diagonalization
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
Jean-Yves Marion