Sciweavers

851 search results - page 70 / 171
» Random constructions and density results
Sort
View
JISE
2010
144views more  JISE 2010»
14 years 5 months ago
Variant Methods of Reduced Set Selection for Reduced Support Vector Machines
In dealing with large datasets the reduced support vector machine (RSVM) was proposed for the practical objective to overcome the computational difficulties as well as to reduce t...
Li-Jen Chien, Chien-Chung Chang, Yuh-Jye Lee
116
Voted
INFOCOM
2011
IEEE
14 years 1 months ago
General capacity scaling of wireless networks
—We study the general scaling laws of the capacity for random wireless networks under the generalized physical model. The generality of this work is embodied in three dimensions ...
Cheng Wang, Changjun Jiang, Xiang-Yang Li, ShaoJie...
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
15 years 5 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
56
Voted
ISCAS
2006
IEEE
99views Hardware» more  ISCAS 2006»
15 years 4 months ago
High-rate quasi-cyclic LDPC codes for magnetic recording channel with low error floor
— By implementing an FPGA-based simulator, we investigate the performance of high-rate quasi-cyclic (QC) LDPC codes for the magnetic recording channel at very low sector error ra...
Hao Zhong, Tong Zhang, Erich F. Haratsch
WEA
2004
Springer
128views Algorithms» more  WEA 2004»
15 years 3 months ago
GRASP with Path-Relinking for the Quadratic Assignment Problem
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio...