Sciweavers

779 search results - page 44 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
WSC
2007
15 years 6 months ago
New greedy myopic and existing asymptotic sequential selection procedures: preliminary empirical results
Statistical selection procedures can identify the best of a finite set of alternatives, where “best” is defined in terms of the unknown expected value of each alternative’...
Stephen E. Chick, Jürgen Branke, Christian Sc...
INFOCOM
2000
IEEE
15 years 8 months ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor
FSKD
2005
Springer
101views Fuzzy Logic» more  FSKD 2005»
15 years 9 months ago
Geometrical Probability Covering Algorithm
Abstract. In this paper, we propose a novel classification algorithm, called geometrical probability covering (GPC) algorithm, to improve classification ability. On the basis of ...
Junping Zhang, Stan Z. Li, Jue Wang
ICCV
2007
IEEE
16 years 6 months ago
Limits of Learning-Based Superresolution Algorithms
Learning-based superresolution (SR) are popular SR techniques that use application dependent priors to infer the missing details in low resolution images (LRIs). However, their pe...
Zhouchen Lin, Junfeng He, Xiaoou Tang, Chi-Keung T...
ISCI
2008
83views more  ISCI 2008»
15 years 4 months ago
A diversity maintaining population-based incremental learning algorithm
In this paper we propose a new probability update rule and sampling procedure for population-based incremental learning. These proposed methods are based on the concept of opposit...
Mario Ventresca, Hamid R. Tizhoosh