Sciweavers

4940 search results - page 50 / 988
» On the Complexity of Universal Programs
Sort
View
JMLR
2010
145views more  JMLR 2010»
14 years 8 months ago
Kernel Partial Least Squares is Universally Consistent
We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Lea...
Gilles Blanchard, Nicole Krämer
CRYPTO
2001
Springer
153views Cryptology» more  CRYPTO 2001»
15 years 6 months ago
Universally Composable Commitments
d Abstract) Ran Canetti and Marc Fischlin Abstract. We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantee...
Ran Canetti, Marc Fischlin
ROBOCUP
1999
Springer
115views Robotics» more  ROBOCUP 1999»
15 years 6 months ago
Robot Football Team from Minho University
This paper describes an Autonomous Mobile Robot team which plays football, developed by the Group of Automation and Robotics at the Industrial Electronics department of the Univers...
Carlos Machado, Ilídio Costa, Sérgio...
VLDB
1999
ACM
89views Database» more  VLDB 1999»
15 years 6 months ago
Physical Data Independence, Constraints, and Optimization with Universal Plans
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
Alin Deutsch, Lucian Popa, Val Tannen
ECCC
2007
90views more  ECCC 2007»
15 years 1 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider