3096 search results - page 281 / 620 » The Generalized FITC Approximation |
195
click to vote
FOCS
2007
IEEE
16 years 29 days ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
174
click to vote
FOCS
2007
IEEE
16 years 29 days ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
200
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
177
click to vote
SIGMOD
2008
ACM
15 years 6 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
189
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...