Sciweavers

14774 search results - page 193 / 2955
» Computational complexity and evolutionary computation
Sort
View
DAC
2009
ACM
16 years 5 months ago
Human computing for EDA
Electronic design automation is a field replete with challenging ? and often intractable ? problems to be solved over very large instances. As a result, the field of design automa...
Andrew DeOrio, Valeria Bertacco
GBRPR
2009
Springer
15 years 11 months ago
Computing and Visualizing a Graph-Based Decomposition for Non-manifold Shapes
Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its...
Leila De Floriani, Daniele Panozzo, Annie Hui
ISPEC
2007
Springer
15 years 11 months 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 9 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 6 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