Sciweavers

13621 search results - page 294 / 2725
» Computability and Complexity in Self-assembly
Sort
View
ISPEC
2007
Springer
16 years 25 days ago
Privacy-Preserving Credentials Upon Trusted Computing Augmented Servers
Credentials are an indispensable means for service access control in electronic commerce. However, regular credentials such as X.509 certificates and SPKI/SDSI certificates do no...
Yanjiang Yang, Robert H. Deng, Feng Bao
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
15 years 11 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
NIPS
2004
15 years 8 months ago
Computing regularization paths for learning multiple kernels
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
Francis R. Bach, Romain Thibaux, Michael I. Jordan
CORR
2007
Springer
74views Education» more  CORR 2007»
15 years 6 months ago
Computing Minimal Polynomials of Matrices
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
Max Neunhöffer, Cheryl E. Praeger
ERCIM
2007
125views more  ERCIM 2007»
15 years 6 months ago
Workflow Management Systems for Grid Computing
With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute s...
Carmen Bratosin, Wil M. P. van der Aalst