Sciweavers

6358 search results - page 341 / 1272
» Computing spectral sequences
Sort
View
IPPS
1997
IEEE
15 years 11 months ago
Work-Time Optimal K-Merge Algorithms on the PRAM
The k-merge problem, given a collection of k, (2  k  n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu
FOCS
1995
IEEE
15 years 10 months ago
Reconstructing Strings from Substrings in Rounds
We establish a variety of combinatorial bounds on the tradeo s inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results ...
Dimitris Margaritis, Steven Skiena
BIRTHDAY
2008
Springer
15 years 8 months ago
Church's Problem and a Tour through Automata Theory
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
Wolfgang Thomas
ISMB
1996
15 years 8 months ago
Parameterization Studies for the SAM and HMMER Methods of Hidden Markov Model Generation
Multiple sequence alignment of distantly related viral proteins remains a challenge to all currently available alignment methods. The hidden Markovmodel approach offers a new,flex...
Marcella A. McClure, Chris Smith, Pete Elton
ACL
2012
13 years 9 months ago
Unsupervised Semantic Role Induction with Global Role Ordering
We propose a probabilistic generative model for unsupervised semantic role induction, which integrates local role assignment decisions and a global role ordering decision in a uni...
Nikhil Garg, James Henserdon