Sciweavers

1333 search results - page 47 / 267
» Not a Number of Floating Point Problems
Sort
View
122
Voted
AAIM
2007
Springer
141views Algorithms» more  AAIM 2007»
15 years 9 months ago
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
15 years 4 months ago
Improved algorithms for orienteering and related problems
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
Chandra Chekuri, Nitish Korula, Martin Pál
DFG
2009
Springer
15 years 10 months ago
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Abstract. We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed, Smith, and Vetta. This technique has proven...
Jiong Guo, Hannes Moser, Rolf Niedermeier
ICCV
2001
IEEE
16 years 5 months ago
Ambiguous Configurations for the 1D Structure and Motion Problem
In this paper we investigate, determine and classify the critical configurations for solving structure and motion problems for 1D retina vision. We give a complete categorization ...
Fredrik Kahl, Kalle Åström
CSLP
2004
Springer
15 years 8 months ago
Problems of Inducing Large Coverage Constraint-Based Dependency Grammar for Czech
Abstract. This article describes an attempt to implement a constraintbased dependency grammar for Czech, a language with rich morphology and free word order, in the formalism Exten...
Ondrej Bojar