16430 search results - page 797 / 3286 » On Computable Tree Functions |
243
click to vote
BIBE
2006
IEEE
16 years 1 months ago
2006
IEEE
DNA sequence alignment is a critical step in identifying homology between organisms. The most widely used alignment program, ClustalW, is known to suffer from the local minima pro...
204
click to vote
PODC
2005
ACM
16 years 1 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
230
click to vote
SI3D
2012
ACM
14 years 3 months ago
2012
ACM
Bounding volume hierarchies (BVHs) are a popular acceleration structure choice for animated scenes rendered with ray tracing. This is due to the relative simplicity of refitting ...
201
click to vote
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper presents a technique, which determines whether an edge is visible for a human eye or not. First, a threshold function is built according to the optical characteristics ...
208
click to vote
WCE
2007
15 years 8 months ago
2007
—One of main issues in point matching is the choice of the mapping function and the computation of its optimal hyperparameters. In this paper, we propose an attractive approach t...