Sciweavers

2869 search results - page 328 / 574
» Metropolis-Hastings algorithms with adaptive proposals
Sort
View
ICC
2008
IEEE
162views Communications» more  ICC 2008»
16 years 1 months ago
Distributed Opportunistic Scheduling in Multihop Wireless Ad Hoc Networks
Abstract—In this paper, we introduce a framework for distributed opportunistic scheduling in multihop wireless ad hoc networks. With the proposed framework, one can take a schedu...
Yijiang Sun, Victor O. K. Li, Ka-Cheong Leung
JVCIR
2006
88views more  JVCIR 2006»
15 years 6 months ago
Morphological wavelet-based stereo image coders
In this paper, we propose a family of novel stereoscopic image coders based on morphological coding and a block-based disparity compensation algorithm. The proposed schemes employ...
J. N. Ellinas, M. S. Sangriotis
KDD
2004
ACM
187views Data Mining» more  KDD 2004»
16 years 7 months ago
IMMC: incremental maximum margin criterion
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or la...
Jun Yan, Benyu Zhang, Shuicheng Yan, Qiang Yang, H...
IPPS
2008
IEEE
16 years 1 months ago
A dynamic scheduling approach for coordinated wide-area data transfers using GridFTP
Many scientific applications need to stage large volumes of files from one set of machines to another set of machines in a wide-area network. Efficient execution of such data t...
Gaurav Khanna 0002, Ümit V. Çataly&uum...
AE
2007
Springer
16 years 26 days ago
The Cooperative Royal Road: Avoiding Hitchhiking
We propose using the so called Royal Road functions as test functions for cooperative co-evolutionary algorithms (CCEAs). The Royal Road functions were created in the early 90’s ...
Gabriela Ochoa, Evelyne Lutton, Edmund K. Burke