Sciweavers

4212 search results - page 341 / 843
» On Compressible Pairings and Their Computation
Sort
View
FUN
2007
Springer
91views Algorithms» more  FUN 2007»
16 years 1 months ago
High Spies (or How to Win a Programming Contest)
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...
André H. Deutz, Rudy van Vliet, Hendrik Jan...
SI3D
2006
ACM
16 years 24 days ago
Animating blendshape faces by cross-mapping motion capture data
Animating 3D faces to achieve compelling realism is a challenging task in the entertainment industry. Previously proposed face transfer approaches generally require a high-quality...
Zhigang Deng, Pei-Ying Chiang, Pamela Fox, Ulrich ...
185
Voted
ICIP
1994
IEEE
15 years 11 months ago
Design of Multi-Dimensional Derivative Filters
Many multi-dimensional signal processing problems require the computation of signal gradients or directional derivatives. Traditional derivative estimates based on adjacent or cen...
Eero P. Simoncelli
ACL
2006
15 years 8 months ago
Sub-Sentential Alignment Using Substring Co-Occurrence Counts
In this paper, we will present an efficient method to compute the co-occurrence counts of any pair of substring in a parallel corpus, and an algorithm that make use of these count...
Fabien Cromierès
ACL
2003
15 years 8 months ago
A Probability Model to Improve Word Alignment
Word alignment plays a crucial role in statistical machine translation. Word-aligned corpora have been found to be an excellent source of translation-related knowledge. We present...
Colin Cherry, Dekang Lin