Sciweavers

202 search results - page 23 / 41
» A more efficient approximation scheme for tree alignment
Sort
View
EMNLP
2009
13 years 5 months ago
Bilingually-Constrained (Monolingual) Shift-Reduce Parsing
Jointly parsing two languages has been shown to improve accuracies on either or both sides. However, its search space is much bigger than the monolingual case, forcing existing ap...
Liang Huang, Wenbin Jiang, Qun Liu
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
14 years 2 months ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....
MICCAI
2009
Springer
14 years 8 months ago
Accelerating Feature Based Registration Using the Johnson-Lindenstrauss Lemma
We introduce an efficient search strategy to substantially accelerate feature based registration. Previous feature based registration algorithms often use truncated search strategi...
Ayelet Akselrod-Ballin, Davi Bock, R. Clay Reid,...
ICALP
2010
Springer
14 years 13 days ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
ICIP
2003
IEEE
14 years 9 months ago
Disparity dependent segmentation based stereo image coding
In this paper, we propose a novel rate-distortion (R-D) optimized disparity based coding scheme for stereo images. This new scheme efficiently integrates the coding of the dispari...
Rahul Shukla, Hayder Radha, Martin Vetterli