Sciweavers

4524 search results - page 193 / 905
» The Complexity of Global Constraints
Sort
View
291
Voted
AROBOTS
2011
15 years 1 months ago
Large scale graph-based SLAM using aerial images as prior information
— To effectively navigate in their environments and accurately reach their target locations, mobile robots require a globally consistent map of the environment. The problem of le...
Rainer Kümmerle, Bastian Steder, Christian Do...
GLOBECOM
2007
IEEE
16 years 29 days ago
Low PAPR STBCs from Complex Partial-Orthogonal Designs (CPODs)
— Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Average power ratio (PAPR) and avoid the problem of turning off antennas. But COD...
Gopu V. R. Muni Kumar, B. Sundar Rajan
GECCO
2007
Springer
153views Optimization» more  GECCO 2007»
16 years 23 days ago
Parallel genetic algorithm: assessment of performance in multidimensional scaling
Visualization of multidimensional data by means of Multidimensional Scaling (MDS) is a popular technique of exploratory data analysis widely usable, e.g. in analysis of bio-medica...
Antanas Zilinskas, Julius Zilinskas
RT
1998
Springer
15 years 10 months ago
Canned Lightsources
Complex luminaries and lamp geometries can greatly increase the realism of synthetic images. Unfortunately, the correct rendering of illumination from complex lamps requires costly...
Wolfgang Heidrich, Jan Kautz, Philipp Slusallek, H...
ICS
2010
Tsinghua U.
16 years 4 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz