Sciweavers

7015 search results - page 4 / 1403
» Approximation algorithms for co-clustering
Sort
View
CORR
2011
Springer
268views Education» more  CORR 2011»
14 years 3 months ago
Approximation Algorithms for Submodular Multiway Partition
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
Chandra Chekuri, Alina Ene
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
13 years 2 months ago
Approximation algorithms for stochastic orienteering
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
13 years 2 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
STOC
2012
ACM
227views Algorithms» more  STOC 2012»
13 years 2 months ago
Approximation algorithms and hardness of integral concurrent flow
Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi...
SODA
2012
ACM
210views Algorithms» more  SODA 2012»
13 years 2 months ago
Approximation algorithms and hardness of the k-route cut problem
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayara...