Sciweavers

2714 search results - page 291 / 543
» Approximation Schemes for Scheduling
Sort
View
FOCS
2008
IEEE
15 years 10 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
COCOON
2005
Springer
15 years 9 months ago
Interval Subset Sum and Uniform-Price Auction Clearing
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
Anshul Kothari, Subhash Suri, Yunhong Zhou
AINA
2007
IEEE
15 years 10 months ago
Efficient Hybrid Channel Access for Data Intensive Sensor Networks
In this paper, we introduce novel probabilistic transmission protocols for data intensive wireless sensor networks. The protocols combine a randomized transmission scheme with sch...
Chih-Kuang Lin, Vladimir Zadorozhny, Prashant Kris...
GLOBECOM
2007
IEEE
15 years 10 months ago
On the Level of Guaranteed Services for Signaling Control in Cellular Networks
— In this paper, we discuss our preliminary work on signaling overload control for cellular services which requires adaptability and scalability as well as guaranteed level of se...
Saowaphak Sasanus, David Tipper
FPL
2004
Springer
117views Hardware» more  FPL 2004»
15 years 9 months ago
Flow Monitoring in High-Speed Networks with 2D Hash Tables
Abstract. Flow monitoring is a required task for a variety of networking applications including fair scheduling and intrusion/anomaly detection. Existing flow monitoring techniques...
David Nguyen, Joseph Zambreno, Gokhan Memik