4797 search results - page 595 / 960 » The complexity of partition tasks |
198
click to vote
CAINE
2008
15 years 8 months ago
2008
Assembly is an NP-Hard problem, which involves comparing fragments that have a time complexity of O(n2 ). This paper presents a parallel approach for sequence assembly. The parall...
169
click to vote
EMNLP
2007
15 years 8 months ago
2007
Deterministic parsing has emerged as an effective alternative for complex parsing algorithms which search the entire search space to get the best probable parse tree. In this pape...
185
click to vote
DRR
2008
15 years 8 months ago
2008
Line segmentation is the first and the most critical pre-processing step for a document recognition/analysis task. Complex handwritten documents with lines running into each other...
154
click to vote
ESANN
2007
15 years 8 months ago
2007
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...
163
click to vote
GCA
2008
15 years 8 months ago
2008
- Size and complexity of grid computing systems increase rapidly. Failures can have adverse effect on application executing on the system. Thus, failure information should be provi...