447 search results - page 78 / 90 » Approximation Algorithms for Directed Steiner Problems |
193
click to vote
ICDT
2009
ACM
16 years 12 days ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
IPSN
2007
Springer
15 years 5 months ago
2007
Springer
Energy-efficient image communication is one of the most important goals for a large class of current and future sensor network applications. This paper presents a quantitative com...
COLT
2004
Springer
15 years 5 months ago
2004
Springer
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
COLT
2010
Springer
14 years 9 months ago
2010
Springer
Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as ...