Sciweavers

3415 search results - page 127 / 683
» Lower Bounds for Kernelizations
Sort
View
NIPS
1996
15 years 5 months ago
Reconstructing Stimulus Velocity from Neuronal Responses in Area MT
We employed a white-noise velocity signal to study the dynamics of the response of single neurons in the cortical area MT to visual motion. Responses were quantified using reverse...
Wyeth Bair, James R. Cavanaugh, J. Anthony Movshon
PKDD
2009
Springer
138views Data Mining» more  PKDD 2009»
15 years 11 months ago
Margin and Radius Based Multiple Kernel Learning
A serious drawback of kernel methods, and Support Vector Machines (SVM) in particular, is the difficulty in choosing a suitable kernel function for a given dataset. One of the appr...
Huyen Do, Alexandros Kalousis, Adam Woznica, Melan...
ICML
2002
IEEE
16 years 5 months ago
On generalization bounds, projection profile, and margin distribution
We study generalization properties of linear learning algorithms and develop a data dependent approach that is used to derive generalization bounds that depend on the margin distr...
Ashutosh Garg, Sariel Har-Peled, Dan Roth
ECAI
2006
Springer
15 years 8 months ago
Improving Bound Propagation
Abstract. This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the b...
Bozhena Bidyuk, Rina Dechter
IJCAI
2007
15 years 5 months ago
Optimal Soft Arc Consistency
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...
Martin C. Cooper, Simon de Givry, Thomas Schiex