Sciweavers

2370 search results - page 125 / 474
» A Structured Set of Higher-Order Problems
Sort
View
WABI
2004
Springer
15 years 11 months ago
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
Jens Gramm
SPIRE
2009
Springer
16 years 26 days ago
Directly Addressable Variable-Length Codes
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
DARS
2000
Springer
141views Robotics» more  DARS 2000»
15 years 10 months ago
Cooperation of Multiple Robots to Solve Maze Tasks
This paper discusses the use of cooperation and distributed intelligence within a robot team to solve a maze problem in which a set of ordered control point tasks has to be perform...
C. R. F. Costa, Eliana P. L. Aude
NIPS
1997
15 years 7 months ago
Mapping a Manifold of Perceptual Observations
Nonlinear dimensionality reduction is formulated here as the problem of trying to find a Euclidean feature-space embedding of a set of observations that preserves as closely as p...
Joshua B. Tenenbaum
BMVC
2010
15 years 4 months ago
Sparse Sparse Bundle Adjustment
Sparse Bundle Adjustment (SBA) is a method for simultaneously optimizing a set of camera poses and visible points. It exploits the sparse primary structure of the problem, where c...
Kurt Konolige