Sciweavers

8294 search results - page 1228 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
CGF
2004
113views more  CGF 2004»
15 years 6 months ago
Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
Jirí Bittner, Michael Wimmer, Harald Piring...
CVPR
2011
IEEE
15 years 1 months ago
Scene Flow Estimation by Growing Correspondence Seeds
A simple seed growing algorithm for estimating scene flow in a stereo setup is presented. Two calibrated and synchronized cameras observe a scene and output a sequence of image p...
Jan Cech, Jordi Sanchez-Riera, Radu Horaud
SPLC
2008
15 years 7 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt
BMCBI
2007
127views more  BMCBI 2007»
15 years 6 months ago
Characterization and simulation of cDNA microarray spots using a novel mathematical model
Background: The quality of cDNA microarray data is crucial for expanding its application to other research areas, such as the study of gene regulatory networks. Despite the fact t...
Hye Young Kim, Seo Eun Lee, Min Jung Kim, Jin Il H...
DAC
2005
ACM
15 years 8 months ago
How accurately can we model timing in a placement engine?
This paper presents a novel placement algorithm for timing optimization based on a new and powerful concept, which we term differential timing analysis. Recognizing that accurate ...
Amit Chowdhary, Karthik Rajagopal, Satish Venkates...
« Prev « First page 1228 / 1659 Last » Next »