5964 search results - page 864 / 1193 » A theory of speculative computation |
210
click to vote
ACMSE
2010
ACM
15 years 1 months ago
2010
ACM
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
182
click to vote
CN
2011
15 years 1 months ago
2011
In this paper, we take a holistic approach to the protocol architecture design in multihop wireless networks. Our goal is to integrate various protocol layers into a rigorous fram...
189
click to vote
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
In this paper all cocyclic Hadamard matrices of order less than 40 are classified. That is, all such Hadamard matrices are explicitly constructed, up to Hadamard equivalence. Thi...
188
click to vote
TCS
2011
15 years 1 months ago
2011
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n + 2)-nomial with a constant term, allowing real exponents as well as real...
189
click to vote
JCST
2010
15 years 1 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...