Sciweavers

3049 search results - page 229 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
APIN
2007
118views more  APIN 2007»
15 years 6 months ago
Using genetic algorithms to reorganize superpeer structure in peer to peer networks
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
Jaymin Kessler, Khaled Rasheed, Ismailcem Budak Ar...
ECCV
1996
Springer
16 years 8 months ago
Euclidean Reconstruction: From Paraperspective to Perspective
In this paper we describe a method to perform Euclidean reconstruction with a perspective camera model. It incrementally performs reconstruction with a paraperspective camera in or...
Stéphane Christy, Radu Horaud
CIKM
2005
Springer
16 years 2 days ago
On the estimation of frequent itemsets for data streams: theory and experiments
In this paper, we devise a method for the estimation of the true support of itemsets on data streams, with the objective to maximize one chosen criterion among {precision, recall}...
Pierre-Alain Laur, Richard Nock, Jean-Emile Sympho...
ICAI
2004
15 years 8 months ago
Action Inhibition
An explicit exploration strategy is necessary in reinforcement learning (RL) to balance the need to reduce the uncertainty associated with the expected outcome of an action and the...
Myriam Abramson
CORR
2010
Springer
104views Education» more  CORR 2010»
15 years 6 months ago
Decentralised Learning MACs for Collision-free Access in WLANs
By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a ...
Minyu Fang, David Malone, Ken R. Duffy, Douglas J....