Sciweavers

1594 search results - page 11 / 319
» Fast Prediction on a Tree
Sort
View
DAC
2004
ACM
15 years 10 months ago
Fast and flexible buffer trees that navigate the physical layout environment
Charles J. Alpert, Milos Hrkic, Jiang Hu, Stephen ...
74
Voted
TKDE
2002
109views more  TKDE 2002»
14 years 9 months ago
Fast Indexing and Visualization of Metric Data Sets using Slim-Trees
Caetano Traina Jr., Agma J. M. Traina, Christos Fa...
ICMCS
2006
IEEE
97views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Fast Progressive Model Refinement Global Motion Estimation Algorithm with Prediction
Global Motion Estimation (GME) is an important part in the object-based applications. In this paper, a fast progressive model refinement (FPMR) GME algorithm is proposed. It can s...
Haifeng Wang, Jia Wang, Qingshan Liu, Hanqing Lu
HASKELL
2009
ACM
15 years 4 months ago
Alloy: fast generic transformations for Haskell
Data-type generic programming can be used to traverse and manipulate specific parts of large heterogeneously-typed tree structures, without the need for tedious boilerplate. Gene...
Neil C. C. Brown, Adam T. Sampson
97
Voted
TKDE
2008
153views more  TKDE 2008»
14 years 9 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang