Sciweavers

756 search results - page 16 / 152
» A new algorithm for Boolean operations on general polygons
Sort
View
KDD
2006
ACM
163views Data Mining» more  KDD 2006»
14 years 8 months ago
New EM derived from Kullback-Leibler divergence
We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we...
Longin Jan Latecki, Marc Sobel, Rolf Lakämper
COMPGEOM
2004
ACM
14 years 1 months ago
New results on shortest paths in three dimensions
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
Joseph S. B. Mitchell, Micha Sharir
ML
1998
ACM
13 years 7 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...
PAKDD
2009
ACM
225views Data Mining» more  PAKDD 2009»
14 years 5 months ago
Change Analysis in Spatial Data by Combining Contouring Algorithms with Supervised Density Functions.
Detecting changes in spatial datasets is important for many fields. In this paper, we introduce a methodology for change analysis in spatial datasets that combines contouring algor...
Christoph F. Eick, Chun-Sheng Chen, Michael D. Twa...
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
14 years 2 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn