Sciweavers

2268 search results - page 249 / 454
» The Essence of Form Abstraction
Sort
View
92
Voted
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 2 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
VLSID
2007
IEEE
97views VLSI» more  VLSID 2007»
16 years 2 months ago
Efficient Microprocessor Verification using Antecedent Conditioned Slicing
We present a technique for automatic verification of pipelined microprocessors using model checking. Antecedent conditioned slicing is an efficient abstraction technique for hardw...
Shobha Vasudevan, Vinod Viswanath, Jacob A. Abraha...
POPL
2005
ACM
16 years 2 months ago
Associated types with class
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
Manuel M. T. Chakravarty, Gabriele Keller, Simon L...
RECOMB
2008
Springer
16 years 2 months ago
Internal Validation of Ancestral Gene Order Reconstruction in Angiosperm Phylogeny
Abstract. Whole genome doubling (WGD), a frequent occurrence during the evolution of the angiopsperms, complicates ancestral gene order reconstruction due to the multiplicity of so...
David Sankoff, Chunfang Zheng, P. Kerr Wall, Claud...
CADE
2007
Springer
16 years 2 months ago
Barendregt's Variable Convention in Rule Inductions
Abstract. Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt&#...
Christian Urban, Stefan Berghofer, Michael Norrish