1099 search results - page 100 / 220 » On the Complexity of Computing Evolutionary Trees |
101
click to vote
COCO
2006
Springer
15 years 1 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
ICCV
2007
IEEE
15 years 12 months ago
2007
IEEE
Models of activity structure for unconstrained environments are generally not available a priori. Recent representational approaches to this end are limited by their computational...
104
click to vote
SIGGRAPH
1995
ACM
15 years 1 months ago
1995
ACM
Recent advances in computer graphics have produced images approaching the elusive goal of photorealism. Since many natural objects are so complex and detailed, they are often not ...
CGF
1998
14 years 9 months ago
1998
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...