Sciweavers

29 search results - page 2 / 6
» A sorting network in bounded arithmetic
Sort
View
ICPP
1995
IEEE
13 years 9 months ago
Generalized Algorithm for Parallel Sorting on Product Networks
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
Antonio Fernández, Nancy Eleser, Kemal Efe
SIROCCO
2007
13 years 7 months ago
Optimal Conclusive Sets for Comparator Networks
A set of input vectors S is conclusive if correct functionality for all input vectors is implied by correct functionality over vectors in S. We consider four functionalities of co...
Guy Even, Tamir Levi, Ami Litman
IJON
1998
82views more  IJON 1998»
13 years 5 months ago
Solving arithmetic problems using feed-forward neural networks
We design new feed-forward multi-layered neural networks which perform di erent elementary arithmetic operations, such as bit shifting, addition of N p-bit numbers, and multiplica...
Leonardo Franco, Sergio A. Cannas
ALGORITHMICA
2000
72views more  ALGORITHMICA 2000»
13 years 5 months ago
Sorting-Based Selection Algorithms for Hypercubic Networks
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based ...
Pascal Berthomé, Afonso Ferreira, Bruce M. ...
BIRTHDAY
1997
Springer
13 years 9 months ago
Expressive Power of Unary Counters
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
Michael Benedikt, H. Jerome Keisler