Sciweavers

291 search results - page 38 / 59
» Approximate centerpoints with proofs
Sort
View
ESOP
1999
Springer
14 years 2 months ago
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
Andreas Podelski, Witold Charatonik, Martin Mü...
FSTTCS
1993
Springer
14 years 2 months ago
Essential Intersection Type Assignment
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculus; these are strict in the sense that they are the representatives of equivalen...
Steffen van Bakel
COMPGEOM
2005
ACM
14 years 18 days ago
Inequalities for the curvature of curves and surfaces
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
David Cohen-Steiner, Herbert Edelsbrunner
CP
2008
Springer
14 years 13 days ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
CLA
2007
14 years 2 days ago
Formal Concepts as Optimal Factors in Boolean Factor Analysis: Implications and Experiments
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes B...
Radim Belohlávek, Vilém Vychodil