2957 search results - page 121 / 592 » The Complexity of Polynomial-Time Approximation |
SODA
2010
ACM
14 years 7 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
TCS
2002
13 years 9 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
ICDE
2006
IEEE
14 years 11 months ago
2006
IEEE
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
CPM
2009
Springer
14 years 4 months ago
2009
Springer
Evolution is usually described as a phylogenetic tree, but due to some exchange of genetic material, it can be represented as a phylogenetic network which has an underlying tree st...
PIMRC
2008
IEEE
14 years 4 months ago
2008
IEEE
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...