Sciweavers

3299 search results - page 492 / 660
» A general mathematics of names
Sort
View
SIGMOD
2010
ACM
151views Database» more  SIGMOD 2010»
15 years 6 months ago
Exploring schema similarity at multiple resolutions
Large, dynamic, and ad-hoc organizations must frequently initiate data integration and sharing efforts with insufficient awareness of how organizational data sources are related. ...
Ken Smith, Craig Bonaceto, Chris Wolf, Beth Yost, ...
ACTA
2010
191views more  ACTA 2010»
15 years 6 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
ALGORITHMICA
2010
188views more  ALGORITHMICA 2010»
15 years 6 months ago
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
Katerina Asdre, Stavros D. Nikolopoulos
APAL
2007
59views more  APAL 2007»
15 years 6 months ago
On the Turing degrees of minimal index sets
We study generalizations of shortest programs as they pertain to Schaefer’s MIN∗ problem. We identify sets of m-minimal and T-minimal indices and characterize their truth-tabl...
Jason Teutsch
CORR
2008
Springer
66views Education» more  CORR 2008»
15 years 6 months ago
A Novel Approach to Formulae Production and Overconfidence Measurement to Reduce Risk in Spreadsheet Modelling
Research on formulae production in spreadsheets has established the practice as high risk yet unrecognised as such by industry. There are numerous software applications that are d...
Simon R. Thorne, David Ball, Zoe Lawson