Sciweavers

37 search results - page 3 / 8
» Computing with Catalan Families, Generically
Sort
View
JUCS
2007
105views more  JUCS 2007»
13 years 10 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran
SBACPAD
2003
IEEE
103views Hardware» more  SBACPAD 2003»
14 years 4 months ago
Performance Analysis Issues for Parallel Implementations of Propagation Algorithm
This paper presents a theoretical study to evaluate the performance of a family of parallel implementations of the propagation algorithm. The propagation algorithm is used to an i...
Leonardo Brenner, Luiz Gustavo Fernandes, Paulo Fe...
NIPS
2004
14 years 7 days ago
Methods for Estimating the Computational Power and Generalization Capability of Neural Microcircuits
What makes a neural microcircuit computationally powerful? Or more precisely, which measurable quantities could explain why one microcircuit C is better suited for a particular fa...
Wolfgang Maass, Robert A. Legenstein, Nils Bertsch...
TASLP
2011
13 years 5 months ago
On the Information Geometry of Audio Streams With Applications to Similarity Computing
Abstract—This paper proposes methods for information processing of audio streams using methods of information geometry. We lay the theoretical groundwork for a framework allowing...
Arshia Cont, Shlomo Dubnov, Gérard Assayag
DIS
2008
Springer
14 years 19 days ago
Constructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...