Sciweavers

715 search results - page 108 / 143
» Second step algorithms in the Burrows-Wheeler compression al...
Sort
View
SI3D
2009
ACM
14 years 2 months ago
Soft irregular shadow mapping: fast, high-quality, and robust soft shadows
We introduce a straightforward, robust, and efficient algorithm for rendering high-quality soft shadows in dynamic scenes. Each frame, points in the scene visible from the eye ar...
Gregory S. Johnson, Warren A. Hunt, Allen Hux, Wil...
TCAD
2008
93views more  TCAD 2008»
13 years 7 months ago
Transforming Cyclic Circuits Into Acyclic Equivalents
Abstract--Designers and high-level synthesis tools can introduce unwanted cycles in digital circuits, and for certain combinational functions, cyclic circuits that are stable and d...
Osama Neiroukh, Stephen A. Edwards, Xiaoyu Song
ECRTS
2003
IEEE
14 years 26 days ago
Using Supertasks to Improve Processor Utilization in Multiprocessor Real-Time Systems
We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a ...
Philip Holman, James H. Anderson
CP
2006
Springer
13 years 11 months ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...