Sciweavers

374 search results - page 22 / 75
» Fast separable factorization and applications
Sort
View
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
13 years 9 months ago
An Experimental Analysis of a Compact Graph Representation
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
DSVIS
2008
Springer
13 years 9 months ago
Graphic Rendering Considered as a Compilation Chain
Graphical rendering must be fast enough so as to avoid hindering the user perception/action loop. Traditionally, programmers interleave descriptions and optimizations to achieve su...
Benjamin Tissoires, Stéphane Conversy
ICIP
2006
IEEE
14 years 9 months ago
Maximum Likelihood Methods for Time-Resolved Imaging Through Turbid Media
Recently technological advances now enable time-gated acquisitions of photons at very fast rates. This can allow one to separate scattered and unscattered photons in transillumina...
Brian Eriksson, Robert Nowak
TOG
2010
157views more  TOG 2010»
13 years 2 months ago
Combining global and local virtual lights for detailed glossy illumination
Accurately rendering glossy materials in design applications, where previewing and interactivity are important, remains a major challenge. While many fast global illumination solu...
Tomás Davidovic, Jaroslav Krivánek, ...
ICSM
2007
IEEE
14 years 1 months ago
A Maintainable Software Architecture for Fast and Modular Bioinformatics Sequence Search
Bioinformaticists use the Basic Local Alignment Search Tool (BLAST) to characterize an unknown sequence by comparing it against a database of known sequences, thus detecting evolu...
Jeremy S. Archuleta, Eli Tilevich, Wu-chun Feng