Sciweavers

388 search results - page 39 / 78
» Robust Lower Bounds for Communication and Stream Computation
Sort
View
168
Voted
ADC
2006
Springer
136views Database» more  ADC 2006»
16 years 1 days ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao
EOR
2008
91views more  EOR 2008»
15 years 6 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini
MOBIHOC
2012
ACM
13 years 8 months ago
Throughput of rateless codes over broadcast erasure channels
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
Yang Yang, Ness B. Shroff
PODS
2006
ACM
96views Database» more  PODS 2006»
16 years 6 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
CCR
2006
92views more  CCR 2006»
15 years 6 months ago
A cooperative uplink power control scheme for elastic data services in wireless CDMA systems
We consider the uplink power control problem in a single cell CDMA wireless data system. Each user specifies upper and lower QoS bounds. We formulate the considered problem as a g...
George Alyfantis, Stathes Hadjiefthymiades, Lazaro...