Sciweavers

2698 search results - page 183 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
16 years 3 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
ICC
2007
IEEE
168views Communications» more  ICC 2007»
16 years 24 days ago
Energy and QoS Aware Packet Forwarding in Wireless Sensor Networks
— We consider energy efficient packet forwarding with quality-of-service (QoS) guarantee for wireless sensor networks (WSNs). In most existing wireless network protocols, route ...
Rong Yu, Yan Zhang, Zhi Sun, Shunliang Mei
PVLDB
2008
116views more  PVLDB 2008»
15 years 6 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
ISCI
2007
138views more  ISCI 2007»
15 years 6 months ago
A fast algorithm for one-unit ICA-R
Independent component analysis (ICA) aims to recover a set of unknown mutually independent source signals from their observed mixtures without knowledge of the mixing coefficients...
Qiu-Hua Lin, Yong-Rui Zheng, Fuliang Yin, Hualou L...
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
15 years 11 months ago
On the Complexity of Approximating the VC Dimension
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
Elchanan Mossel, Christopher Umans