Sciweavers

328 search results - page 41 / 66
» Deterministic k-set structure
Sort
View
NIPS
1998
13 years 8 months ago
SMEM Algorithm for Mixture Models
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Ryohei Nakano, Zoubin Ghahramani, Ge...
NN
2002
Springer
136views Neural Networks» more  NN 2002»
13 years 7 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
SCL
2010
132views more  SCL 2010»
13 years 2 months ago
Convergence in human decision-making dynamics
A class of binary decision-making tasks called the two-alternative forced-choice task has been used extensively in psychology and behavioral economics experiments to investigate h...
Ming Cao, Andrew Reed Stewart, Naomi Ehrich Leonar...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 17 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
NPIV
1999
ACM
142views Visualization» more  NPIV 1999»
13 years 11 months ago
ALMOST: Exploring Program Traces
We built a tool to visualize and explore program execution traces. Our goal was to help programmers without any prior knowledge of a program, quickly get enough knowledge about it...
Manos Reniers, Steven P. Reis