Sciweavers

26 search results - page 4 / 6
» ipl 2000
Sort
View
IPL
2000
82views more  IPL 2000»
13 years 9 months ago
Estimating the number of vertices of a polyhedron
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P. The estimates are based on applying tree estimation methods ...
David Avis, Luc Devroye
IPL
2000
72views more  IPL 2000»
13 years 9 months ago
Generalized interpolation in CASL
In this paper we consider the partial many-sorted first-order logic and its extension to the subsorted partial many-sorted first-order logic that underly the Casl specification fo...
Tomasz Borzyszkowski
IPL
2010
160views more  IPL 2010»
13 years 8 months ago
Antimagic labeling and canonical decomposition of graphs
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
Michael D. Barrus
ADAEUROPE
2000
Springer
14 years 2 months ago
(True) Polymorphism in SPARK2000
of the Reliant Telco Platform, K. Wiesneth Safety-oriented INTERBUS INTERBUS Safety-, K. Meyer-Graefe Developing a Binding Process for Automated Program Recognition and Fault Local...
Tse-Min Lin, John A. McDermid
IPL
2000
101views more  IPL 2000»
13 years 9 months ago
Visual cryptography for grey level images
Visual cryptography is a cryptographic paradigm introduced by Naor and Shamir [Lecture Notes in Comput. Sci., Vol. 950, Springer, Berlin, 1995, p. 1]. Some predefined set of parti...
Carlo Blundo, Alfredo De Santis, Moni Naor