6358 search results - page 152 / 1272 » Computing spectral sequences |
281
click to vote
ICOST
2011
Springer
14 years 10 months ago
2011
Springer
Falls are one of the major risks for seniors living alone at home. Computer vision systems, which do not require to wear sensors, offer a new and promising solution for fall detec...
171
click to vote
DCC
2009
IEEE
16 years 7 months ago
2009
IEEE
Rapid development of DNA sequencing technologies exponentially increases the amount of publicly available genomic data. Whole genome multiple sequence alignments represent a parti...
165
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
159
click to vote
DGCI
2006
Springer
15 years 10 months ago
2006
Springer
A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in the 2D square grid; and 3D cubic, face-centered cubic, and...
140
click to vote
MFCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...