8917 search results - page 333 / 1784 » Abstraction in Algorithm Animation |
121
click to vote
MICCAI
2003
Springer
16 years 4 months ago
2003
Springer
Abstract. Interpolation of field data from unstructured meshes requires the potentially expensive identification of the finite element or volume within which the interpolating poin...
112
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
118
click to vote
ALT
2009
Springer
16 years 23 days ago
2009
Springer
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
130
click to vote
WALCOM
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
145
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...