Sciweavers

3019 search results - page 150 / 604
» Approximating the Domatic Number
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 6 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
TROB
2010
58views more  TROB 2010»
15 years 4 months ago
Localization: Approximation and Performance Bounds to Minimize Travel Distance
Abstract—Localization, which is the determination of one’s location in a known terrain, is a fundamental task for autonomous robots. This paper presents several new basic theor...
Craig A. Tovey, Sven Koenig
SAICSIT
2010
ACM
15 years 4 months ago
Numberplate detection using double segmentation
Numberplate detection plays an important role in public transportation systems. Before numberplate detection can be performed, the region of interest that contains the numberplate ...
Pei Li, James Connan
ICTAI
2009
IEEE
15 years 4 months ago
Real-Valued Feature Selection by Mutual Information of Order 2
The selection of features for classification, clustering and approximation is an important task in pattern recognition, data mining and soft computing. For real-valued features, th...
Rüdiger W. Brause
MOC
2010
15 years 1 months ago
hp-Optimal discontinuous Galerkin methods for linear elliptic problems
Abstract. The aim of this paper is to present and analyze a class of hpversion discontinuous Galerkin (DG) discretizations for the numerical approximation of linear elliptic proble...
Benjamin Stamm, Thomas P. Wihler