Sciweavers

5595 search results - page 310 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
FOCS
2006
IEEE
16 years 22 days ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng
184
Voted
ISPEC
2010
Springer
15 years 11 months ago
On Fast and Approximate Attack Tree Computations
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
Aivo Jürgenson, Jan Willemson
AAAI
2004
15 years 8 months ago
Discriminating Among Word Meanings by Identifying Similar Contexts
Word sense discrimination is an unsupervised clustering problem, which seeks to discover which instances of a word/s are used in the same meaning. This is done strictly based on i...
Amruta Purandare, Ted Pedersen
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
15 years 10 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge

Lecture Notes
443views
17 years 4 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount