Sciweavers

1333 search results - page 99 / 267
» Not a Number of Floating Point Problems
Sort
View
ICA
2007
Springer
15 years 10 months ago
On Separation of Signal Sources Using Kernel Estimates of Probability Densities
The discussion in this paper revolves around the notion of separation problems. The latter can be thought of as a unifying concept which includes a variety of important problems in...
Oleg V. Michailovich, Douglas Wiens
FOCS
1992
IEEE
15 years 7 months ago
Maximizing Non-Linear Concave Functions in Fixed Dimension
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
Sivan Toledo
CCCG
2010
15 years 5 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette
147
Voted
AAAI
2004
15 years 5 months ago
Bayesian Inference on Principal Component Analysis Using Reversible Jump Markov Chain Monte Carlo
Based on the probabilistic reformulation of principal component analysis (PCA), we consider the problem of determining the number of principal components as a model selection prob...
Zhihua Zhang, Kap Luk Chan, James T. Kwok, Dit-Yan...
141
Voted
CORR
2010
Springer
219views Education» more  CORR 2010»
15 years 3 months ago
Clustering high dimensional data using subspace and projected clustering algorithms
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
Rahmat Widia Sembiring, Jasni Mohamad Zain, Abdull...