Sciweavers

87 search results - page 15 / 18
» Optimal fault-tolerant linear arrays
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Full regularization path for sparse principal component analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the numb...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
ICASSP
2011
IEEE
12 years 11 months ago
Distributed LCMV beamforming in wireless sensor networks with node-specific desired signals
We consider distributed linearly constrained minimum variance (LCMV) beamforming in a wireless sensor network. Each node computes an LCMV beamformer with node-specific constraint...
Alexander Bertrand, Marc Moonen
SBCCI
2009
ACM
187views VLSI» more  SBCCI 2009»
14 years 4 days ago
Design of low complexity digital FIR filters
The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications (MCM), has been a central operation and performance bottleneck in many applicat...
Levent Aksoy, Diego Jaccottet, Eduardo Costa
SPAA
1999
ACM
13 years 11 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 7 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...