2069 search results - page 211 / 414 » Linear time algorithms for Clobber |
183
click to vote
SMA
2010
ACM
15 years 6 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
187
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...
176
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
156
click to vote
STOC
2000
ACM
15 years 11 months ago
2000
ACM
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
200
click to vote
TCOM
2010
15 years 5 months ago
2010
We consider two nodes equipped with multiple antennas that intend to communicate i.e. both of which transmit and receive data. We model the responses of the communication channels...