Sciweavers

2703 search results - page 429 / 541
» Optimizing memory transactions
Sort
View
TCOM
2010
83views more  TCOM 2010»
14 years 10 months ago
Global and Fast Receiver Antenna Selection for MIMO Systems
Abstract--For a multiple-input multiple-output (MIMO) system with more antennas at the receiver than the transmitter, selecting the same number of receiver antennas as the number o...
Bu Hong Wang, Hon Tat Hui, Mook Seng Leong
PE
2011
Springer
274views Optimization» more  PE 2011»
14 years 9 months ago
A generalized method of moments for closed queueing networks
We introduce a new solution technique for closed product-form queueing networks that generalizes the Method of Moments (MoM), a recently proposed exact algorithm that is several o...
Giuliano Casale
217
Voted
EDBT
2011
ACM
281views Database» more  EDBT 2011»
14 years 6 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
14 years 6 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
JMLR
2012
13 years 5 months ago
Krylov Subspace Descent for Deep Learning
In this paper, we propose a second order optimization method to learn models where both the dimensionality of the parameter space and the number of training samples is high. In ou...
Oriol Vinyals, Daniel Povey