Sciweavers

1813 search results - page 282 / 363
» Instance Pruning Techniques
Sort
View
IFIP
2001
Springer
15 years 9 months ago
Systemic Functional Hypertexts (SFHT):
Abstract: On the background of rising Intranet applications the automatic generation of adaptable, context-sensitive hypertexts becomes more and more important [El-Beltagy et al., ...
Alexander Mehler, Rodney J. Clarke
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
15 years 9 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
ICCD
2000
IEEE
120views Hardware» more  ICCD 2000»
15 years 9 months ago
Equivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
Viresh Paruthi, Andreas Kuehlmann
ICFP
2000
ACM
15 years 9 months ago
Syntactic accidents in program analysis: on the impact of the CPS transformation
We show that a non-duplicating transformation into Continuation-Passing Style (CPS) has no effect on control-flow analysis, a positive effect on binding-time analysis for tradi...
Daniel Damian, Olivier Danvy
COLT
2000
Springer
15 years 9 months ago
PAC Analogues of Perceptron and Winnow via Boosting the Margin
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Rocco A. Servedio