Sciweavers

697 search results - page 39 / 140
» Approximation of Information Granule Sets
Sort
View
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 27 days ago
Concavity of Mutual Information Rate for Input-Restricted Finite-State Memoryless Channels at High SNR
We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavio...
Guangyue Han, Brian H. Marcus
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
15 years 11 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
INFOCOM
1998
IEEE
15 years 10 months ago
Informed-Source Coding-on-Demand (ISCOD) over Broadcast Channels
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
Yitzhak Birk, Tomer Kol
DASFAA
2005
IEEE
136views Database» more  DASFAA 2005»
15 years 11 months ago
Distributed Intersection Join of Complex Interval Sequences
In many different application areas, e.g. space observation systems or engineering systems of world-wide operating companies, there is a need for an efficient distributed intersect...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
CP
2005
Springer
15 years 11 months ago
Using Constraint Programming for Solving Distance CSP with Uncertainty
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...
Carlos Grandón, Bertrand Neveu