Sciweavers

555 search results - page 96 / 111
» Efficiently Implementing Episodic Memory
Sort
View
WSCG
2004
161views more  WSCG 2004»
13 years 10 months ago
Rendering Techniques for Hardware-Accelerated Image-Based CSG
Image-based CSG rendering algorithms for standard graphics hardware rely on multipass rendering that includes reading and writing large amounts of pixel data from and to the frame...
Florian Kirsch, Jürgen Döllner
ISMB
1996
13 years 10 months ago
Compact Encoding Strategies for DNA Sequence Similarity Search
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
David J. States, Pankaj Agarwal
OSDI
1994
ACM
13 years 10 months ago
Lottery Scheduling: Flexible Proportional-Share Resource Management
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rat...
Carl A. Waldspurger, William E. Weihl
CGF
2008
200views more  CGF 2008»
13 years 8 months ago
Deep Opacity Maps
We present a new method for rapidly computing shadows from semi-transparent objects like hair. Our deep opacity maps method extends the concept of opacity shadow maps by using a d...
Cem Yuksel, John Keyser
ALMOB
2006
80views more  ALMOB 2006»
13 years 8 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel