Sciweavers

478 search results - page 16 / 96
» Improving probability bounds by optimization over subsets
Sort
View
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
DCC
2007
IEEE
14 years 7 months ago
Low-density attack revisited
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi ...
ICDE
2004
IEEE
99views Database» more  ICDE 2004»
14 years 9 months ago
Proving Ownership over Categorical Data
This paper introduces a novel method of rights protection for categorical data through watermarking. We discover new watermark embedding channels for relational data with categori...
Radu Sion
TWC
2011
367views more  TWC 2011»
13 years 2 months ago
Improving the Performance of Wireless Ad Hoc Networks Through MAC Layer Design
—In this paper, the performance of the ALOHA and CSMA MAC protocols are analyzed in spatially distributed wireless networks. The main system objective is correct reception of pac...
Mariam Kaynia, Nihar Jindal, Geir E. Øien
CISS
2008
IEEE
14 years 2 months ago
Rate adaptation via link-layer feedback for goodput maximization over a time-varying channel
Abstract—We consider adapting the transmission rate to maximize the goodput, i.e., the amount of data transmitted without error, over a continuous Markov flat-fading wireless ch...
Rohit Aggarwal, Phil Schniter, Can Emre Koksal