Sciweavers

4255 search results - page 245 / 851
» On Learning Boolean Functions
Sort
View
CVPR
2010
IEEE
16 years 2 months ago
Learning Shift-Invariant Sparse Representation of Actions
A central problem in the analysis of motion capture (Mo- Cap) data is how to decompose motion sequences into primitives. Ideally, a description in terms of primitives should fac...
Yi Li
ICALT
2008
IEEE
16 years 1 months ago
Interaction Analysis as a Multi-Support Approach of Social Computing for Learning, in the "Collaborative Era": Lessons Learned b
Apparently computer technology is shifting its focus, with individual users not being the main target any more. The evolution of Web 2.0 technologies is promoting the development ...
Tharrenos Bratitsis, Angelique Dimitracopoulou
NIPS
1994
15 years 7 months ago
From Data Distributions to Regularization in Invariant Learning
Ideally pattern recognition machines provide constant output when the inputs are transformed under a group G of desired invariances. These invariances can be achieved by enhancing...
Todd K. Leen
MFCS
2009
Springer
16 years 1 months ago
Branching Programs for Tree Evaluation
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
16 years 22 days ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson