Sciweavers

3656 search results - page 159 / 732
» Compact Location Problems
Sort
View
TSP
2008
118views more  TSP 2008»
15 years 4 months ago
Approximating Functions From Sampled Fourier Data Using Spline Pseudofilters
Recently, new polynomial approximation formulas were proposed for the reconstruction of compactly supported piecewise smooth functions from Fourier data. Formulas for zero and firs...
Ana Gabriela Martínez, Alvaro R. De Pierro
ICASSP
2011
IEEE
14 years 8 months ago
Factor graph switching portfolios under transaction costs
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...
Andrew J. Bean, Andrew C. Singer
IROS
2006
IEEE
159views Robotics» more  IROS 2006»
15 years 11 months ago
Multi-Level Surface Maps for Outdoor Terrain Mapping and Loop Closing
— To operate outdoors or on non-flat surfaces, mobile robots need appropriate data structures that provide a compact representation of the environment and at the same time suppo...
Rudolph Triebel, Patrick Pfaff, Wolfram Burgard
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
15 years 6 months ago
Adaptive discretization on multidimensional continuous search spaces
This paper extends an adaptive discretization method, Spliton-Demand (SoD), to be capable of handling multidimensional continuous search spaces. The proposed extension is called m...
Jiun-Jiue Liou, Ying-Ping Chen
156
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
The 2-center problem in three dimensions
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir