10608 search results - page 506 / 2122 » Complexity of O'Hara's Algorithm |
171
Voted
DSN
2007
IEEE
16 years 12 days ago
2007
IEEE
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
144
Voted
ICC
2007
IEEE
16 years 12 days ago
2007
IEEE
— In this paper, the application of combinatorial geometry to noncoherent multiple–symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as...
155
click to vote
COCO
2007
Springer
16 years 7 days ago
2007
Springer
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomialtime-bounded Kolmogoro...
135
click to vote
KES
1998
Springer
15 years 10 months ago
1998
Springer
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
180
click to vote
NAACL
2010
15 years 4 months ago
2010
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...