Sciweavers

6274 search results - page 207 / 1255
» From query complexity to computational complexity
Sort
View
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
CORR
2004
Springer
123views Education» more  CORR 2004»
15 years 4 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
143
Voted
FOCS
1999
IEEE
15 years 9 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
BCS
2008
15 years 6 months ago
Beatbox - A Computer Simulation Environment for Computational Biology of the Heart
Despite over a century's study, the trigger mechanisms of cardiac arrhythmias are poorly understood. Even modern experimental methods do not provide sufficient temporal and s...
Ross McFarlane, Irina V. Biktasheva
PERCOM
2004
ACM
16 years 4 months ago
Models, Protocols, and Architectures for Secure Pervasive Computing: Challenges and Research Directions
We explore the challenges and research directions in building models, protocols and architectures to support security in pervasive computing environments. We argue that to be succ...
Roshan K. Thomas, Ravi S. Sandhu