Sciweavers

1404 search results - page 243 / 281
» Complexity of admissible rules
Sort
View
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 8 months ago
Shallow Circuits with High-Powered Inputs
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
Pascal Koiran
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 8 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 8 months ago
Discrete Partitioning and Coverage Control for Gossiping Robots
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
Joseph W. Durham, Ruggero Carli, Paolo Frasca, Fra...
ALIFE
2006
13 years 8 months ago
The Infection Algorithm: An Artificial Epidemic Approach for Dense Stereo Correspondence
We present a new bio-inspired approach applied to a problem of stereo image matching. This approach is based on an artificial epidemic process, which we call the infection algorith...
Gustavo Olague, Francisco Fernández, Cynthi...
IAJIT
2006
109views more  IAJIT 2006»
13 years 8 months ago
Unconstraint Assignment Problem: A Molecular Computing Approach
: Deoxyribonucleic Acid or DNA-based computing is an emerging field that bridging the gap between chemistry, molecular biology, computer science, and mathematics. This research are...
Zuwairie Ibrahim, Yusei Tsuboi, Osamu Ono, Marzuki...