Sciweavers

3250 search results - page 56 / 650
» Parameterized Learning Complexity
Sort
View
ICML
2009
IEEE
14 years 10 months ago
Learning non-redundant codebooks for classifying complex objects
Codebook-based representations are widely employed in the classification of complex objects such as images and documents. Most previous codebook-based methods construct a single c...
Wei Zhang, Akshat Surve, Xiaoli Fern, Thomas G. Di...
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
14 years 6 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...
MMAS
2011
Springer
13 years 4 months ago
Scalable Bayesian Reduced-Order Models for Simulating High-Dimensional Multiscale Dynamical Systems
While existing mathematical descriptions can accurately account for phenomena at microscopic scales (e.g. molecular dynamics), these are often high-dimensional, stochastic and thei...
Phaedon-Stelios Koutsourelakis, Elias Bilionis
ML
2002
ACM
128views Machine Learning» more  ML 2002»
13 years 9 months ago
A Simple Method for Generating Additive Clustering Models with Limited Complexity
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
Michael D. Lee
ICPR
2006
IEEE
14 years 11 months ago
Direct Mapping of Visual Input to Motor Torques
Most methods for visual control of robots formulate the robot command in joint or Cartesian space. To move the robot these commands are remapped to motor torques usually requiring...
Jeremiah J. Neubert, Nicola J. Ferrier