Sciweavers

4886 search results - page 221 / 978
» Approximate Data Exchange
Sort
View
TSP
2008
115views more  TSP 2008»
15 years 6 months ago
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 2 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
SIGMOD
1996
ACM
99views Database» more  SIGMOD 1996»
15 years 10 months ago
A Query Language for Multidimensional Arrays: Design, Implementation, and Optimization Techniques
While much recent research has focussed on extending databases beyond the traditional relational model, relatively little has been done to develop database tools for querying data...
Leonid Libkin, Rona Machlin, Limsoon Wong
DEXA
2004
Springer
136views Database» more  DEXA 2004»
15 years 11 months ago
A Framework for Representing Moving Objects
We present a framework for representing the trajectories of moving objects and the time-varying results of operations on moving objects. This framework supports the realization of ...
Ludger Becker, Henrik Blunck, Klaus Hinrichs, Jan ...
IPL
2008
135views more  IPL 2008»
15 years 6 months ago
On the Positive-Negative Partial Set Cover problem
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
Pauli Miettinen