Sciweavers

2069 search results - page 43 / 414
» Linear time algorithms for Clobber
Sort
View
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
15 years 5 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
COR
2008
102views more  COR 2008»
15 years 3 months ago
An algorithm for ranking assignments using reoptimization
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
Christian Roed Pedersen, Lars Relund Nielsen, Kim ...
NAACL
2010
15 years 1 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
Carlos Gómez-Rodríguez, Marco Kuhlma...
JSAC
2006
91views more  JSAC 2006»
15 years 3 months ago
Robust Linear Receivers for Multiaccess Space-Time Block-Coded MIMO Systems: A Probabilistically Constrained Approach
Traditional multiuser receiver algorithms developed for multiple-input
Yue Rong, Sergiy A. Vorobyov, Alex B. Gershman
WABI
2010
Springer
160views Bioinformatics» more  WABI 2010»
15 years 2 months ago
Genomic Distance with DCJ and Indels
The double cut and join (DCJ) operation, introduced by Yancopoulos, Attie and Friedberg in 2005, allows one to represent most rearrangement events in genomes. However, a DCJ cannot...
Marília D. V. Braga, Eyla Willing, Jens Sto...