Sciweavers

5595 search results - page 276 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Training structural SVMs when exact inference is intractable
While discriminative training (e.g., CRF, structural SVM) holds much promise for machine translation, image segmentation, and clustering, the complex inference these applications ...
Thomas Finley, Thorsten Joachims
SYNASC
2006
IEEE
106views Algorithms» more  SYNASC 2006»
16 years 16 days ago
A Quality Measure for Multi-Level Community Structure
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
Maylis Delest, Jean-Marc Fedou, Guy Melanço...
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 10 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
EDBT
2006
ACM
191views Database» more  EDBT 2006»
16 years 6 months ago
Distributed Spatial Clustering in Sensor Networks
Abstract. Sensor networks monitor physical phenomena over large geographic regions. Scientists can gain valuable insight into these phenomena, if they understand the underlying dat...
Anand Meka, Ambuj K. Singh
WINE
2009
Springer
138views Economy» more  WINE 2009»
16 years 1 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing