1451 search results - page 123 / 291 » Order independence and rationalizability |
189
click to vote
SMI
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents a new way to model clothing worn by articulated implicit characters. A scalar field is produced using ellipsoids as primitives. Isosurfaces are then used to pl...
198
click to vote
ICPADS
1998
IEEE
15 years 10 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
161
click to vote
ISSS
1998
IEEE
15 years 10 months ago
1998
IEEE
Commonly used scheduling algorithms in high-level synthesis are not capable of sharing resources across process boundaries. This results in the usage of at least one resource per ...
186
click to vote
CIKM
1998
Springer
15 years 10 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
152
click to vote
SAC
1998
ACM
15 years 10 months ago
1998
ACM
In a Video-on-Demand server, requests from different clients are independent of each other and may arrive at random time. Commercial systems may contain hundreds to thousands of c...