Sciweavers

1647 search results - page 183 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
CORR
2010
Springer
225views Education» more  CORR 2010»
15 years 5 months ago
Sensing Matrix Optimization for Block-Sparse Decoding
Recent work has demonstrated that using a carefully designed sensing matrix rather than a random one, can improve the performance of compressed sensing. In particular, a welldesign...
Kevin Rosenblum, Lihi Zelnik-Manor, Yonina C. Elda...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 10 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
147
Voted
TPDS
2008
136views more  TPDS 2008»
15 years 4 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
ICDM
2009
IEEE
175views Data Mining» more  ICDM 2009»
15 years 2 months ago
Maximum Margin Clustering with Multivariate Loss Function
This paper presents a simple but powerful extension of the maximum margin clustering (MMC) algorithm that optimizes multivariate performance measure specifically defined for clust...
Bin Zhao, James Tin-Yau Kwok, Changshui Zhang
ICCSA
2010
Springer
15 years 12 months ago
String Matching with Mismatches by Real-Valued FFT
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
Kensuke Baba