Sciweavers

4770 search results - page 678 / 954
» Flexible Type Analysis
Sort
View
TSD
2005
Springer
16 years 4 days ago
Why Is the Recognition of Spontaneous Speech so Hard?
Although speech, derived from reading texts, and similar types of speech, e.g. that from reading newspapers or that from news broadcast, can be recognized with high accuracy, recog...
Sadaoki Furui, Masanobu Nakamura, Tomohisa Ichiba,...
DOLAP
2004
ACM
16 years 2 days ago
Developing a characterization of business intelligence workloads for sizing new database systems
Computer system sizing involves estimating the amount of hardware resources needed to support a new workload not yet deployed in a production environment. In order to determine th...
Ted J. Wasserman, Patrick Martin, David B. Skillic...
PLDI
2004
ACM
16 years 2 days ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
ESORICS
2004
Springer
16 years 1 days ago
ARCHERR: Runtime Environment Driven Program Safety
Parameters of a program’s runtime environment such as the machine architecture and operating system largely determine whether a vulnerability can be exploited. For example, the m...
Ramkumar Chinchani, Anusha Iyer, Bharat Jayaraman,...
ICALP
2004
Springer
16 years 1 days ago
A Domain Theoretic Account of Picard's Theorem
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
Abbas Edalat, Dirk Pattinson