Sciweavers

995 search results - page 161 / 199
» Learning Useful Horn Approximations
Sort
View
CORR
2006
Springer
109views Education» more  CORR 2006»
15 years 28 days ago
Decision Making with Side Information and Unbounded Loss Functions
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
Majid Fozunbal, Ton Kalker
IJON
2007
99views more  IJON 2007»
15 years 24 days ago
Criticality of avalanche dynamics in adaptive recurrent networks
In many studies of self-organized criticality (SOC), branching processes were used to model the dynamics of the activity of the system during avalanches. This mathematical simpli...
Anna Levina, Udo Ernst, J. Michael Herrmann

Publication
433views
15 years 9 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre
122
Voted
JACM
2010
208views more  JACM 2010»
14 years 11 months ago
The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies
clustering of documents according to sharing of topics at multiple levels of abstraction. Given a corpus of documents, a posterior inference algorithm finds an approximation to a ...
David M. Blei, Thomas L. Griffiths, Michael I. Jor...
FLAIRS
2010
14 years 11 months ago
Decision-Theoretic Simulated Annealing
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...
Todd W. Neller, Christopher J. La Pilla