Sciweavers

1091 search results - page 164 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
CISS
2008
IEEE
14 years 2 months ago
Relay selection methods for wireless cooperative communications
— We study the problem of relay selection in a wireless cooperative network. Assuming a single source, a single destination, and N uniformly distributed candidate relays, we seek...
Seunghoon Nam, Mai Vu, Vahid Tarokh
NIPS
2007
13 years 9 months ago
Parallelizing Support Vector Machines on Distributed Computers
Support Vector Machines (SVMs) suffer from a widely recognized scalability problem in both memory use and computational time. To improve scalability, we have developed a parallel ...
Edward Y. Chang, Kaihua Zhu, Hao Wang, Hongjie Bai...
SDM
2009
SIAM
140views Data Mining» more  SDM 2009»
14 years 5 months ago
Straightforward Feature Selection for Scalable Latent Semantic Indexing.
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
Jun Yan, Shuicheng Yan, Ning Liu, Zheng Chen
CDC
2010
IEEE
210views Control Systems» more  CDC 2010»
13 years 3 months ago
Advances in moving horizon estimation for nonlinear systems
In the past decade, moving horizon estimation (MHE) has emerged as a powerful technique for estimating the state of a dynamical system in the presence of nonlinearities and disturb...
Angelo Alessandri, Marco Baglietto, Giorgio Battis...
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
14 years 10 days ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim