Sciweavers

6368 search results - page 1077 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
173
Voted
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 7 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
TNN
2008
181views more  TNN 2008»
15 years 6 months ago
Optimized Approximation Algorithm in Neural Networks Without Overfitting
In this paper, an optimized approximation algorithm (OAA) is proposed to address the overfitting problem in function approximation using neural networks (NNs). The optimized approx...
Yinyin Liu, Janusz A. Starzyk, Zhen Zhu
ICDCS
2009
IEEE
16 years 1 months ago
Stochastic Multicast with Network Coding
The usage of network resources by content providers is commonly governed by Service Level Agreements (SLA) between the content provider and the network service provider. Resource ...
Ajay Gopinathan, Zongpeng Li
PAMI
2010
170views more  PAMI 2010»
15 years 4 months ago
On the Decoding Process in Ternary Error-Correcting Output Codes
—A common way to model multiclass classification problems is to design a set of binary classifiers and to combine them. Error-Correcting Output Codes (ECOC) represent a successfu...
Sergio Escalera, Oriol Pujol, Petia Radeva
JNCA
2011
102views more  JNCA 2011»
14 years 9 months ago
Multi-objective zone mapping in large-scale distributed virtual environments
In large-scale distributed virtual environments (DVEs), the NP-hard zone mapping problem concerns how to assign distinct zones of the virtual world to a number of distributed serv...
Ta Nguyen Binh Duong, Suiping Zhou, Wentong Cai, X...
« Prev « First page 1077 / 1274 Last » Next »