Sciweavers

513 search results - page 50 / 103
» Test Construction for Mathematical Functions
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 6 months ago
Is submodularity testable?
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
C. Seshadhri, Jan Vondrák
SCALESPACE
2007
Springer
14 years 2 months ago
Level Set Methods for Watershed Image Segmentation
In this work a marker-controlled and regularized watershed segmentation is proposed. Only a few previous studies address the task of regularizing the obtained watershed lines from ...
Xue-Cheng Tai, Erlend Hodneland, Joachim Weickert,...
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 8 months ago
Executable Set Theory and Arithmetic Encodings in Prolog
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
Paul Tarau
DAM
2007
100views more  DAM 2007»
13 years 7 months ago
Memory management optimization problems for integrated circuit simulators
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
Timothée Bossart, Alix Munier Kordon, Franc...
ITA
2007
153views Communications» more  ITA 2007»
13 years 7 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...