Sciweavers

1379 search results - page 188 / 276
» The Complexity of the Annihilating Polynomial
Sort
View
FSTTCS
2010
Springer
15 years 4 months ago
Computing Rational Radical Sums in Uniform TC^0
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
Paul Hunter, Patricia Bouyer, Nicolas Markey, Jo&e...
GLOBECOM
2010
IEEE
15 years 4 months ago
Dynamic Channel Selection in Cognitive Radio Network with Channel Heterogeneity
We consider the channel selection problem in a cognitive radio network with heterogenous channel availabilities at different nodes. We formulate the maximum channel selection (MCS)...
Fen Hou, Jianwei Huang
GLOBECOM
2010
IEEE
15 years 4 months ago
Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and Optimality
Streaming erasure codes encode a source stream to guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper intro...
Ahmed Badr, Ashish Khisti, Emin Martinian
IBERAMIA
2010
Springer
15 years 4 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick