Sciweavers

523 search results - page 91 / 105
» On the Power of Quantum Proofs
Sort
View
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
14 years 11 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
INFORMS
2007
123views more  INFORMS 2007»
14 years 11 months ago
Constructing Ensembles from Data Envelopment Analysis
It has been shown in prior work in management science, statistics and machine learning that using an ensemble of models often results in better performance than using a single ‘...
Zhiqiang Zheng, Balaji Padmanabhan
BMCBI
2005
99views more  BMCBI 2005»
14 years 11 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich
ENTCS
2002
128views more  ENTCS 2002»
14 years 11 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
TAPOS
1998
83views more  TAPOS 1998»
14 years 11 months ago
A Structured Text ADT for Object-Relational Databases
There is a growing need, both for use within corporate intranets and within the rapidly evolving World Wide Web, to develop tools that are able to retrieve relevant textual inform...
L. J. Brown, Mariano P. Consens, Ian J. Davis, Chr...