6045 search results - page 895 / 1209 » Computable Linearizations of Well-partial-orderings |
245
click to vote
CONCUR
1993
Springer
15 years 11 months ago
1993
Springer
During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...
183
click to vote
WG
1993
Springer
15 years 10 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
201
click to vote
ACCV
2007
Springer
15 years 10 months ago
2007
Springer
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
190
click to vote
ISSAC
1995
Springer
15 years 10 months ago
1995
Springer
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
199
click to vote
AMDO
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present a new method to simulate deformable volumetric objects interactively using finite elements. With quadratic basis functions and a non-linear strain tensor, we a...