Sciweavers

8132 search results - page 288 / 1627
» Dependability, Abstraction, and Programming
Sort
View
FSTTCS
1993
Springer
15 years 10 months ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
CSCW
2004
ACM
16 years 4 days ago
Sometimes you need to see through walls: a field study of application programming interfaces
Information hiding is one of the most important and influential principles in software engineering. It prescribes that software modules hide implementation details from other modu...
Cleidson R. B. de Souza, David F. Redmiles, Li-Te ...
ACL
1992
15 years 7 months ago
Estimating Upper and Lower Bounds on the Performance of Word-Sense Disambiguation Programs
We have recently reported on two new word-sense disambiguation systems, one trained on bilingual material (the Canadian Hansards) and the other trained on monolingual material (Ro...
William A. Gale, Kenneth Ward Church, David Yarows...
ESOP
2004
Springer
16 years 3 days ago
Static Analysis of Digital Filters
We present an Abstract Interpretation-based framework for automatically analyzing programs containing digital filters. Our framework allows refining existing analyses so that the...
Jérôme Feret