Sciweavers

1578 search results - page 162 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
14 years 3 months ago
Matching Polyhedral Terrains Using Overlays of Envelopes
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
Vladlen Koltun, Carola Wenk
GIS
2009
ACM
14 years 4 months ago
Trajectory simplification method for location-based social networking services
The increasing availabilities of GPS-enabled devices have given rise to the location-based social networking services (LBSN), in which users can record their travel experiences wi...
Yukun Chen, Kai Jiang, Yu Zheng, Chunping Li, Neng...
CCECE
2006
IEEE
14 years 4 months ago
New Constraints on Generation of Uniform Random Samples from Evolutionary Trees
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
14 years 3 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener
ICAISC
2010
Springer
14 years 2 months ago
Quasi-parametric Recovery of Hammerstein System Nonlinearity by Smart Model Selection
In the paper we recover a Hammerstein system nonlinearity. Hammerstein systems, incorporating nonlinearity and dynamics, play an important role in various applications, and e¤ecti...
Zygmunt Hasiewicz, Grzegorz Mzyk, Przemyslaw Sliwi...