Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15618735

Correlation clustering

Author
BANSAL, Nikhil1 ; BLUM, Avrim1 ; CHAWLA, Shuchi1
[1] Department of Computer Science, Carnegie Mellon University, United States
Conference title
FOCS 2002 : foundations of computer science (Vancouver BC, 16-19 November 2002)
Conference name
Annual IEEE symposium on foundations of computer science (43 ; Vancouver BC 2002-11-16)
Author (monograph)
IEEE Computer Society, Technical Committee on Mathematical Foundations of Computing, United States (Organiser of meeting)
Source

Annual Symposium on Foundations of Computer Science. 2002, pp 238-247, 10 p ; ref : 20 ref

ISBN
0-7695-1822-2
Scientific domain
Computer science
Publisher
IEEE, Los Alamitos CA
Publication country
United States
Document type
Conference Paper
Language
English
Keyword (fr)
Algorithme approximation Analyse amas Classification Corrélation Graphe complet Graphe connexe Partition Taux erreur Temps polynomial
Keyword (en)
Approximation algorithm Cluster analysis Classification Correlation Complete graph Connected graph Partition Error rate Polynomial time
Keyword (es)
Algoritmo aproximación Analisis cluster Clasificación Correlación Grafo completo Grafo conexo Partición Indice error Tiempo polinomial
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
15618735

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Searching the Web