3946 search results - page 438 / 790 » The computational complexity of choice sets |
160
click to vote
SIGGRAPH
1989
ACM
15 years 11 months ago
1989
ACM
This paper will examine hypertexture rendering techniques and will demonstrate how volume data sets may be adapted in order for hypertexture to be applied. Details are given of a c...
211
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
176
click to vote
ISSAC
1995
Springer
15 years 10 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
189
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
-- In previous work, Hu and Dill identified a common cause of BDD-size blowup in high-level design verification and proposed the method of implicitly conjoined invariants to addres...
208
click to vote
AMDO
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In this paper, we present a novel, fast, resolution-independent silhouette area-based matching approach. We approximate the silhouette area by a small set of axis-aligned...