Sciweavers

42 search results - page 6 / 9
» The Tile Complexity of Linear Assemblies
Sort
View
NAACL
2003
13 years 8 months ago
Greedy Decoding for Statistical Machine Translation in Almost Linear Time
We present improvements to a greedy decoding algorithm for statistical machine translation that reduce its time complexity from at least cubic (  ¢¡¤£¦¥¨§ when applied na...
Ulrich Germann
BIOCOMP
2007
13 years 9 months ago
xMAN: extreme MApping of oligoNucleotides
Background: The ability to rapidly map millions of oligonucleotide fragments to a reference genome is crucial to many high throughput genomic technologies. Results: We propose an ...
Wei Li, Jason S. Carroll, Myles Brown, X. Shirley ...
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
13 years 11 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...
IJCNLP
2005
Springer
14 years 28 days ago
Using Multiple Discriminant Analysis Approach for Linear Text Segmentation
Research on linear text segmentation has been an on-going focus in NLP for the last decade, and it has great potential for a wide range of applications such as document summarizati...
Jingbo Zhu, Na Ye, Xinzhi Chang, Wenliang Chen, Be...
ICCV
2009
IEEE
1234views Computer Vision» more  ICCV 2009»
15 years 12 days ago
Human Pose Estimation Using Consistent Max-Covering
We propose a novel consistent max-covering scheme for human pose estimation. Consistent max-covering formulates pose estimation as the covering of body part polygons on an objec...
Hao Jiang