Sciweavers

174 search results - page 18 / 35
» Algorithms for center and Tverberg points
Sort
View
CCCG
2006
13 years 8 months ago
Rotationally Monotone Polygons
We introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monotone with respect to a point r if there exists a partitioning of the boundary of P into ex...
Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Ste...
KDD
2002
ACM
194views Data Mining» more  KDD 2002»
14 years 7 months ago
Scale Space Exploration For Mining Image Information Content
Images are highly complex multidimensional signals, with rich and complicated information content. For this reason they are difficult to analyze through a unique automated approach...
Mariana Ciucu, Patrick Héas, Mihai Datcu, J...
ICCS
2007
Springer
13 years 10 months ago
Adaptive Sparse Grid Classification Using Grid Environments
Common techniques tackling the task of classification in data mining employ ansatz functions associated to training data points to fit the data as well as possible. Instead, the fe...
Dirk Pflüger, Ioan Lucian Muntean, Hans-Joach...
GEOINFO
2003
13 years 8 months ago
An Early Warning System for Space-Time Cluster Detection
A new topic of great relevance and concern has been the design of efficient early warning systems to detect as soon as possible the emergence of spatial clusters. In particular, m...
Renato M. Assunção, Andréa Ia...
COMPGEOM
2003
ACM
14 years 10 min ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner