Sciweavers

1387 search results - page 81 / 278
» Convexity in Discrete Space
Sort
View
COMPGEOM
2005
ACM
15 years 8 months ago
Inclusion-exclusion formulas from independent complexes
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
Dominique Attali, Herbert Edelsbrunner
COMPGEOM
2005
ACM
15 years 8 months ago
Fast construction of nets in low dimensional metrics, and their applications
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
Sariel Har-Peled, Manor Mendel
ENTCS
2002
93views more  ENTCS 2002»
15 years 6 months ago
Matroids from modules
The aim of this work is to show that (oriented) matroid methods can be applied to many discrete geometries, namely those based on modules over integral (ordered) domains. The tric...
Nils Anders Danielsson, Michael B. Smyth
ICCAD
2006
IEEE
127views Hardware» more  ICCAD 2006»
16 years 3 months ago
Importance of volume discretization of single and coupled interconnects
This paper presents figures of merit and error formulae to determine which interconnects require volume discretization in the GHZ range. Most of the previous work focused mainly o...
Ahmed Shebaita, Dusan Petranovic, Yehea I. Ismail
ECML
2007
Springer
16 years 10 days ago
Nondeterministic Discretization of Weights Improves Accuracy of Neural Networks
Abstract. The paper investigates modification of backpropagation algorithm, consisting of discretization of neural network weights after each training cycle. This modification, a...
Marcin Wojnarski