Sciweavers

6110 search results - page 424 / 1222
» Approximate Computing
Sort
View
225
Voted
CG
2006
Springer
15 years 7 months ago
Interruptible collision detection for deformable objects
This paper presents an approach to performing time-critical collision detection for deformable objects. The deformable objects are represented by dense meshes and their deformatio...
César Mendoza, Carol O'Sullivan
221
Voted
MST
2006
149views more  MST 2006»
15 years 7 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
AES
2007
Springer
109views Cryptology» more  AES 2007»
15 years 7 months ago
Compatible coarsening in the multigraph algorithm
We present some heuristics incorporating the philosophy of compatible relaxation into an existing algebraic multigrid method, the so-called multigraph solver of Bank and Smith [1]...
Randolph E. Bank
221
Voted
TMI
2010
155views more  TMI 2010»
15 years 2 months ago
3D Forward and Back-Projection for X-Ray CT Using Separable Footprints
The greatest impediment to practical adoption of iterative methods for X-ray CT is the computation burden of cone-beam forward and back-projectors. Moreover, forward and back-proje...
Yong Long, Jeffrey A. Fessler, James M. Balter
AAAI
1998
15 years 9 months ago
Solving Very Large Weakly Coupled Markov Decision Processes
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, L...