Sciweavers

7106 search results - page 1000 / 1422
» Restricted Complexity, General Complexity
Sort
View
ISAAC
2005
Springer
78views Algorithms» more  ISAAC 2005»
16 years 13 days ago
The Phase Matrix
Reducing the error of quantum algorithms is often achieved by applying a primitive called amplitude amplification. Its use leads in many instances to quantum algorithms that are q...
Peter Høyer
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
16 years 12 days ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
LCTRTS
2005
Springer
16 years 12 days ago
System-wide compaction and specialization of the linux kernel
The limited built-in configurability of Linux can lead to expensive code size overhead when it is used in the embedded market. To overcome this problem, we propose the applicatio...
Dominique Chanet, Bjorn De Sutter, Bruno De Bus, L...
MIDDLEWARE
2005
Springer
16 years 12 days ago
Sensor bean: a component platform for sensor-based services
Sensor-based services propose to gather, manage, analyze, access and react to sensor data. These services are distributed over heterogeneous platforms. The complexity of the imple...
Cristina Marin, Mikael Desertot
NIME
2005
Springer
136views Music» more  NIME 2005»
16 years 12 days ago
Learning Advanced Skills on New Instruments (or practising scales and arpeggios on your NIME)
When learning a classical instrument, people often either take lessons in which an existing body of “technique” is delivered, evolved over generations of performers, or in som...
Sageev Oore
« Prev « First page 1000 / 1422 Last » Next »