Sciweavers

293 search results - page 26 / 59
» Geometric algorithms for clearance based optimal path comput...
Sort
View
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
15 years 5 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
78
Voted
ECCV
2000
Springer
16 years 1 months ago
A Six Point Solution for Structure and Motion
The paper has two main contributions: The rst is a set of methods for computing structure and motion for m 3 views of 6 points. It is shown that a geometric image error can be mini...
Frederik Schaffalitzky, Andrew Zisserman, Richard ...
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
14 years 11 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
COR
2006
94views more  COR 2006»
14 years 11 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...
ICPR
2008
IEEE
15 years 6 months ago
Fast model selection for MaxMinOver-based training of support vector machines
OneClassMaxMinOver (OMMO) is a simple incremental algorithm for one-class support vector classification. We propose several enhancements and heuristics for improving model select...
Fabian Timm, Sascha Klement, Thomas Martinetz