1092 search results - page 91 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
143
click to vote
SODA
2010
ACM
16 years 3 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...
181
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
193
click to vote
ACID
2006
15 years 7 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
186
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the ...
152
click to vote
APPROX
2009
Springer
16 years 18 days 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...