Sciweavers

575 search results - page 60 / 115
» A Note on Karr's Algorithm
Sort
View
SIGMOD
1993
ACM
77views Database» more  SIGMOD 1993»
15 years 3 months ago
The oo7 Benchmark
The OO7 Benchmark represents a comprehensive test of OODBMS performance. In this report we describe the benchmark and present performance results from its implementation in four O...
Michael J. Carey, David J. DeWitt, Jeffrey F. Naug...
EURODAC
1995
IEEE
137views VHDL» more  EURODAC 1995»
15 years 2 months ago
A formal non-heuristic ATPG approach
This paper presents a formal approach to test combinational circuits. For the sake of explanation we describe the basic algorithms with the help of the stuck–at fault model. Ple...
Manfred Henftling, Hannes C. Wittmann, Kurt Antrei...
ACL
2004
15 years 18 days ago
Using Linguistic Principles to Recover Empty Categories
This paper describes an algorithm for detecting empty nodes in the Penn Treebank (Marcus et al., 1993), finding their antecedents, and assigning them function tags, without access...
Richard Campbell
ICASSP
2010
IEEE
14 years 11 months ago
High precision frequency estimation for harpsichord tuning classification
We present a novel music signal processing task of classifying the tuning of a harpsichord from audio recordings of standard musical works. We report the results of a classificat...
Dan Tidhar, Matthias Mauch, Simon Dixon
ENTCS
2008
64views more  ENTCS 2008»
14 years 11 months ago
Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
In this note we consider the computability of the solution of the initial-value problem for ordinary differential equations with continuous right-hand side. We present algorithms ...
Pieter Collins, Daniel S. Graça