8728 search results - page 399 / 1746 » On Reduct Construction Algorithms |
174
click to vote
BMVC
2001
15 years 9 months ago
2001
We address the problem of non-rigid motion and correspondence estimation in 3D images in the absense of prior domain information. A generic framework is utilized in which a soluti...
167
click to vote
CCCG
2010
15 years 8 months ago
2010
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...
150
click to vote
AAAI
2000
15 years 8 months ago
2000
Selecting the right word translation among several options in the lexicon is a core problem for machine translation. We present a novel approach to this problem that can be traine...
149
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
171
click to vote
DM
2002
15 years 6 months ago
2002
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...