Sciweavers

917 search results - page 172 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
CGF
2006
100views more  CGF 2006»
13 years 9 months ago
Ray Tracing Animated Scenes using Motion Decomposition
Though ray tracing has recently become interactive, its high precomputation time for building spatial indices usually limits its applications to walkthroughs of static scenes. Thi...
Johannes Günther, Heiko Friedrich, Ingo Wald,...
AIPS
2009
13 years 10 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...
BMCBI
2010
189views more  BMCBI 2010»
13 years 9 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
PAMI
2006
186views more  PAMI 2006»
13 years 8 months ago
Performance Evaluation of Fingerprint Verification Systems
This paper is concerned with the performance evaluation of fingerprint verification systems. After an initial classification of biometric testing initiatives, we explore both the t...
Raffaele Cappelli, Dario Maio, Davide Maltoni, Jam...
ISPD
2005
ACM
188views Hardware» more  ISPD 2005»
14 years 2 months ago
A semi-persistent clustering technique for VLSI circuit placement
Placement is a critical component of today's physical synthesis flow with tremendous impact on the final performance of VLSI designs. However, it accounts for a significant p...
Charles J. Alpert, Andrew B. Kahng, Gi-Joon Nam, S...