Sciweavers

627 search results - page 4 / 126
» Branched Polyhedral Systems
Sort
View
ICPPW
2006
IEEE
14 years 1 months ago
Parallel Implementation of the Polyhedral Homotopy Method
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
Jan Verschelde, Yan Zhuang
CASES
2006
ACM
13 years 11 months ago
Power efficient branch prediction through early identification of branch addresses
Ever increasing performance requirements have elevated deeply pipelined architectures to a standard even in the embedded processor domain, requiring the incorporation of dynamic b...
Chengmo Yang, Alex Orailoglu
HIPEAC
2007
Springer
14 years 1 months ago
Branch History Matching: Branch Predictor Warmup for Sampled Simulation
Computer architects and designers rely heavily on simulation. The downside of simulation is that it is very time-consuming — simulating an industry-standard benchmark on today...
Simon Kluyskens, Lieven Eeckhout
CC
2010
Springer
144views System Software» more  CC 2010»
14 years 1 months ago
The Polyhedral Model Is More Widely Applicable Than You Think
Mohamed-Walid Benabderrahmane, Louis-Noël Pou...
RT
2001
Springer
13 years 12 months ago
Polyhedral Visual Hulls for Real-Time Rendering
We present new algorithms for creating and rendering visual hulls in real-time. Unlike voxel or sampled approaches, we compute an exact polyhedral representation for the visual hul...
Wojciech Matusik, Chris Buehler, Leonard McMillan