Sciweavers

619 search results - page 81 / 124
» Random Bichromatic Matchings
Sort
View
ISCAS
1994
IEEE
104views Hardware» more  ISCAS 1994»
14 years 1 months ago
Stereo Correspondence with Discrete-Time Cellular Neural Networks
In this paper, we propose a new approach of solving the stereopsis problem with a discrete-time cellular neural network(DTCNN) where each node has connectionsonly with its local n...
Sungjun Park, Seung-Jai Min, Soo-Ik Chae
GBRPR
2007
Springer
14 years 25 days ago
Constellations and the Unsupervised Learning of Graphs
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
Boyan Bonev, Francisco Escolano, Miguel Angel Loza...
NIPS
2008
13 years 10 months ago
Algorithms for Infinitely Many-Armed Bandits
We consider multi-armed bandit problems where the number of arms is larger than the possible number of experiments. We make a stochastic assumption on the mean-reward of a new sel...
Yizao Wang, Jean-Yves Audibert, Rémi Munos
NIPS
2008
13 years 10 months ago
Bayesian Model of Behaviour in Economic Games
Classical game theoretic approaches that make strong rationality assumptions have difficulty modeling human behaviour in economic games. We investigate the role of finite levels o...
Debajyoti Ray, Brooks King-Casas, P. Read Montague...
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
13 years 10 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari