Sciweavers

595 search results - page 19 / 119
» Incidence of
Sort
View
CCCG
2010
13 years 10 months ago
Those ubiquitous cut polyhedra
I first met Paul Erd
David Avis
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
13 years 9 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
COMGEO
2010
ACM
13 years 8 months ago
Pointed binary encompassing trees: Simple and optimal
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
CMPB
2008
63views more  CMPB 2008»
13 years 7 months ago
SAS and R functions to compute pseudo-values for censored data regression
Recently, in a series of papers, a method based on pseudo-values has been proposed for direct regression modeling of the survival function, the restricted mean and cumulative inci...
John P. Klein, Mette Gerster, Per Kragh Andersen, ...
ISCAS
2007
IEEE
119views Hardware» more  ISCAS 2007»
14 years 2 months ago
Hardened by Design Techniques for Implementing Multiple-Bit Upset Tolerant Static Memories
— We present a novel MBU-tolerant design, which utilizes layout-based interleaving and multiple-node disruption tolerant memory latches. This approach protects against grazing in...
Daniel R. Blum, José G. Delgado-Frias