Sciweavers

419 search results - page 35 / 84
» Succincter
Sort
View
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
15 years 9 months ago
On the Complexity of Approximating the VC Dimension
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
Elchanan Mossel, Christopher Umans
FASE
2001
Springer
15 years 9 months ago
Debugging via Run-Time Type Checking
This paper describes the design and implementation of a tool for C programs that provides run-time checks based on type information. The tool instruments a program to monitor the t...
Alexey Loginov, Suan Hsi Yong, Susan Horwitz, Thom...
KBSE
2000
IEEE
15 years 9 months ago
Practical Large Scale What-If Queries: Case Studies with Software Risk Assessment
When a lack of data inhibits decision making, large scale what-if queries can be conducted over the uncertain parameter ranges. Such what-if queries can generate an overwhelming a...
Tim Menzies, Erik Sinsel
CC
1998
Springer
134views System Software» more  CC 1998»
15 years 9 months ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson
129
Voted
IFIP
1998
Springer
15 years 9 months ago
Media Transformations for the Representation and Communication of Multimedia Production Activities
Case studies made of multimedia document production highlight the need for a means of classifying and describing the transformations of media elements which make up this process. ...
S. Morris