Sciweavers

4770 search results - page 251 / 954
» Flexible Type Analysis
Sort
View
ICCSA
2007
Springer
15 years 9 months ago
Improving the Customization of Natural Language Interface to Databases Using an Ontology
Natural language interfaces to databases are considered one of the best alternatives for final users who wish to make complex, uncommon and frequent queries, which is a very common...
M. Jose A. Zarate, Rodolfo A. Pazos, Alexander F. ...
PEPM
2009
ACM
16 years 4 months ago
Bidirectional data-flow analyses, type-systematically
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
Maria João Frade, Ando Saabas, Tarmo Uustal...
PEPM
2010
ACM
16 years 4 months ago
Making "stricterness" more relevant
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
Stefan Holdermans, Jurriaan Hage
PERCOM
2010
ACM
15 years 5 months ago
All for one or one for all? Combining heterogeneous features for activity spotting
Abstract—Choosing the right feature for motion based activity spotting is not a trivial task. Often, features derived by intuition or that proved to work well in previous work ar...
Ulf Blanke, Bernt Schiele, Matthias Kreil, Paul Lu...
ESOP
2010
Springer
16 years 4 months ago
Amortized Resource Analysis with Polynomial Potential - A Static Inference of Polynomial Bounds for Functional Programs
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. ...
Jan Hoffmann and Martin Hofmann