787 search results - page 130 / 158 » Polynomial Constants are Decidable |
154
click to vote
PODS
2007
ACM
16 years 4 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
136
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
118
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
123
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
126
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...