Sciweavers

10608 search results - page 66 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
TAMC
2007
Springer
15 years 9 months ago
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
Michael Dom, Jiong Guo, Rolf Niedermeier
COLING
1996
15 years 4 months ago
Top-Down Predictive Linking and Complex-Feature-Based Formalisms
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
James Kilbury
JC
2006
105views more  JC 2006»
15 years 3 months ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
16 years 15 days ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski
GLOBECOM
2008
IEEE
15 years 9 months ago
Reduced Complexity ML Detection for Differential Unitary Space-Time Modulation with Carrier Frequency Offset
— Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been...
Feifei Gao, Arumugam Nallanathan, Chintha Tellambu...