Sciweavers

1326 search results - page 195 / 266
» Approximate Tree Kernels
Sort
View
FSTTCS
2010
Springer
15 years 1 months ago
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
Gagan Goel, Pushkar Tripathi, Lei Wang
146
Voted
ICIP
2010
IEEE
15 years 1 months ago
Restoration of images and 3D data to higher resolution by deconvolution with sparsity regularization
Image convolution is conventionally approximated by the LTI discrete model. It is well recognized that the higher the sampling rate, the better is the approximation. However somet...
Yingsong Zhang, Nick G. Kingsbury
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 6 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
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 3 months ago
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
Deeparnab Chakrabarty, Chaitanya Swamy
CVPR
2004
IEEE
16 years 5 months ago
Cue Integration through Discriminative Accumulation
Object recognition systems aiming to work in real world settings should use multiple cues in order to achieve robustness. We present a new cue integration scheme which extends the...
Maria-Elena Nilsback, Barbara Caputo