Sciweavers

4255 search results - page 204 / 851
» On Learning Boolean Functions
Sort
View
ICONIP
2010
15 years 3 months ago
Emergence of Highly Nonrandom Functional Synaptic Connectivity Through STDP
Abstract. We investigated the network topology organized through spike-timingdependent plasticity (STDP) using pair- and triad-connectivity patterns, considering di erence of excit...
Hideyuki Kato, Tohru Ikeguchi
TNN
2010
216views Management» more  TNN 2010»
15 years 1 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
ICML
2007
IEEE
16 years 7 months ago
Intractability and clustering with constraints
Clustering with constraints is a developing area of machine learning. Various papers have used constraints to enforce particular clusterings, seed clustering algorithms and even l...
Ian Davidson, S. S. Ravi
IROS
2009
IEEE
155views Robotics» more  IROS 2009»
16 years 1 months ago
Active learning using mean shift optimization for robot grasping
— When children learn to grasp a new object, they often know several possible grasping points from observing a parent’s demonstration and subsequently learn better grasps by tr...
Oliver Kroemer, Renaud Detry, Justus H. Piater, Ja...
JCSS
2008
120views more  JCSS 2008»
15 years 6 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson