Sciweavers

867 search results - page 106 / 174
» The Generalized Maximum Coverage Problem
Sort
View
MP
2010
163views more  MP 2010»
13 years 2 months ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Christoph Buchheim, Frauke Liers, Marcus Oswald
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
12 years 10 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
13 years 5 months ago
A Sparsification Approach for Temporal Graphical Model Decomposition
Temporal causal modeling can be used to recover the causal structure among a group of relevant time series variables. Several methods have been developed to explicitly construct te...
Ning Ruan, Ruoming Jin, Victor E. Lee, Kun Huang
CORR
2008
Springer
131views Education» more  CORR 2008»
13 years 8 months ago
Jamming in Fixed-Rate Wireless Systems with Power Constraints - Part I: Fast Fading Channels
This is the first part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading, under the general assumption that the jammer has no...
George T. Amariucai, Shuangqing Wei
STACS
2010
Springer
14 years 2 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri