Sciweavers

1594 search results - page 20 / 319
» Fast Prediction on a Tree
Sort
View
ISBRA
2010
Springer
14 years 2 months ago
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees
Abstract. Hybridization is a reticulate evolutionary process. An established problem on hybridization is computing the minimum number of hybridization events, called the hybridizat...
Yufeng Wu, Jiayin Wang
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 8 months ago
Porting Decision Tree Algorithms to Multicore using FastFlow
The whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine ...
Marco Aldinucci, Salvatore Ruggieri, Massimo Torqu...
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 12 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 9 months ago
Fast mixing for independent sets, colorings and other models on trees
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
Fabio Martinelli, Alistair Sinclair, Dror Weitz
FPGA
2008
ACM
168views FPGA» more  FPGA 2008»
13 years 9 months ago
Architectural improvements for field programmable counter arrays: enabling efficient synthesis of fast compressor trees on FPGAs
The Field Programmable Counter Array (FPCA) was introduced to improve FPGA performance for arithmetic circuits. An FPCA is a reconfigurable IP core that can be integrated into an ...
Alessandro Cevrero, Panagiotis Athanasopoulos, Had...