Sciweavers

177 search results - page 8 / 36
» Fast Simulation of Realistic Trees
Sort
View
RECOMB
2010
Springer
15 years 2 months ago
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers
(Motivation) Tree reconciliation is an approach that explains the discrepancies between two evolutionary trees by a number of events such as speciations, duplications, transfers an...
Jean-Philippe Doyon, Celine Scornavacca, K. Yu. Go...
RTA
2007
Springer
15 years 11 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
INFOCOM
2005
IEEE
15 years 10 months ago
Fast replication in content distribution overlays
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
Samrat Ganguly, Akhilesh Saxena, Sudeept Bhatnagar...
139
Voted
TCAD
2010
135views more  TCAD 2010»
14 years 11 months ago
DeFer: Deferred Decision Making Enabled Fixed-Outline Floorplanning Algorithm
In this paper, we present DeFer--a fast, high-quality, scalable, and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a nonslicing floorplan by compacting a sli...
Jackey Z. Yan, Chris Chu
RT
2000
Springer
15 years 8 months ago
Fast Global Illumination Including Specular Effects
Rapidly simulating global illumination, including diffuse and glossy light transport is a very difficult problem. Finite element or radiosity approaches can achieve interactive si...
Xavier Granier, George Drettakis, Bruce Walter