Sciweavers

204 search results - page 26 / 41
» Parameterized Complexity of Cardinality Constrained Optimiza...
Sort
View
DCOSS
2005
Springer
14 years 26 days ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
INFOCOM
2010
IEEE
13 years 5 months ago
Optimal Probing for Unicast Network Delay Tomography
—Network tomography has been proposed to ascertain internal network performances from end-to-end measurements. In this work, we present priority probing, an optimal probing schem...
Yu Gu, Guofei Jiang, Vishal Singh, Yueping Zhang
SIGMOD
2012
ACM
222views Database» more  SIGMOD 2012»
11 years 9 months ago
Tiresias: a demonstration of how-to queries
In this demo, we will present Tiresias, the first how-to query engine. How-to queries represent fundamental data analysis questions of the form: “How should the input change in...
Alexandra Meliou, Yisong Song, Dan Suciu
CORR
2007
Springer
167views Education» more  CORR 2007»
13 years 7 months ago
Optimal Solutions for Sparse Principal Component Analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
CVPR
2007
IEEE
14 years 9 months ago
Optimizing Distribution-based Matching by Random Subsampling
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
Alex Po Leung, Shaogang Gong