Sciweavers

5699 search results - page 108 / 1140
» Alternating model trees
Sort
View
VLSID
2005
IEEE
100views VLSI» more  VLSID 2005»
16 years 4 months ago
A Fast Buffered Routing Tree Construction Algorithm under Accurate Delay Model
Buffer insertion method plays a great role in modern VLSI design. Many buffer insertion algorithms have been proposed in recent years. However, most of them used simplified delay ...
Yibo Wang, Yici Cai, Xianlong Hong
FOSSACS
2009
Springer
15 years 11 months ago
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Christopher Broadbent, C.-H. Luke Ong
ECIR
2007
Springer
15 years 6 months ago
Model Tree Learning for Query Term Weighting in Question Answering
Question answering systems rely on retrieval components to identify documents that contain an answer to a user’s question. The formulation of queries that are used for retrieving...
Christof Monz
UAI
2001
15 years 5 months ago
Markov Chain Monte Carlo using Tree-Based Priors on Model Structure
We present a general framework for defining priors on model structure and sampling from the posterior using the Metropolis-Hastings algorithm. The key ideas are that structure pri...
Nicos Angelopoulos, James Cussens
PKDD
2005
Springer
92views Data Mining» more  PKDD 2005»
15 years 10 months ago
Mining Model Trees from Spatial Data
Mining regression models from spatial data is a fundamental task in Spatial Data Mining. We propose a method, namely Mrs-SMOTI, that takes advantage from a tight-integration with s...
Donato Malerba, Michelangelo Ceci, Annalisa Appice