Sciweavers

520 search results - page 6 / 104
» Computing recombination networks from binary sequences
Sort
View
100
Voted
ICPP
1992
IEEE
15 years 1 months ago
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
Minze V. Chien, A. Yavuz Oruç
ICCV
2011
IEEE
13 years 9 months ago
3D Reconstruction of a Smooth Articulated Trajectory from a Monocular Image Sequence
An articulated trajectory is defined as a trajectory that remains at a fixed distance with respect to a parent trajectory. In this paper, we present a method to reconstruct an a...
Hyun Soo Park, Yaser Sheikh
DGCI
2006
Springer
15 years 1 months ago
A Network Flow Algorithm for Binary Image Reconstruction from Few Projections
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...
Kees Joost Batenburg
67
Voted
NIPS
2008
14 years 11 months ago
On Computational Power and the Order-Chaos Phase Transition in Reservoir Computing
Randomly connected recurrent neural circuits have proven to be very powerful models for online computations when a trained memoryless readout function is appended. Such Reservoir ...
Benjamin Schrauwen, Lars Buesing, Robert A. Legens...
ICPR
2002
IEEE
15 years 10 months ago
Usefulness of Boundary Sequences in Computing Shape Features for Arbitrary Shaped Regions
A boundary sequence is a good representation of arbitrary shaped regions, but not directly used in computing shape features such as area, centroid, orientation, and so forth. In t...
Seongok Kim, Sungyoung Kim, Jongmin Kim, Minhwan K...