198 search results - page 27 / 40 » On the Lower Bound of Local Optimums in K-Means Algorithm |
AI
2010
Springer
13 years 7 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
IPCO
2010
13 years 8 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
SIGMOD
2010
ACM
14 years 6 days ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Received signal strength (RSS) based source localization papers often ignore the practical effects of range limits in the measurements. In many devices, this results in some senso...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...