Sciweavers

8499 search results - page 235 / 1700
» cans 2009
Sort
View
CORR
2010
Springer
102views Education» more  CORR 2010»
15 years 6 months ago
On the Design of Efficient CSMA Algorithms for Wireless Networks
Recently, it has been shown that CSMA algorithms which use queue length-based link weights can achieve throughput optimality in wireless networks. In particular, a key result by Ra...
Javad Ghaderi, R. Srikant
RP
2010
Springer
118views Control Systems» more  RP 2010»
15 years 4 months ago
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
Zdenek Sawa
SAT
2010
Springer
127views Hardware» more  SAT 2010»
15 years 4 months ago
Symmetry and Satisfiability: An Update
Abstract. The past few years have seen significant progress in algorithms and heuristics for both SAT and symmetry detection. Additionally, the thesis that some of SAT's intra...
Hadi Katebi, Karem A. Sakallah, Igor L. Markov
167
Voted
ACL
2009
15 years 4 months ago
K-Best A* Parsing
A parsing makes 1-best search efficient by suppressing unlikely 1-best items. Existing kbest extraction methods can efficiently search for top derivations, but only after an exhau...
Adam Pauls, Dan Klein
ACL
2009
15 years 4 months ago
Application-driven Statistical Paraphrase Generation
Paraphrase generation (PG) is important in plenty of NLP applications. However, the research of PG is far from enough. In this paper, we propose a novel method for statistical par...
Shiqi Zhao, Xiang Lan, Ting Liu, Sheng Li