Sciweavers

4131 search results - page 153 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
IEEESCC
2009
IEEE
15 years 1 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
185
Voted
CORR
2011
Springer
268views Education» more  CORR 2011»
14 years 7 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
116
Voted
ML
2002
ACM
121views Machine Learning» more  ML 2002»
15 years 3 months ago
Choosing Multiple Parameters for Support Vector Machines
The problem of automatically tuning multiple parameters for pattern recognition Support Vector Machines (SVMs) is considered. This is done by minimizing some estimates of the gener...
Olivier Chapelle, Vladimir Vapnik, Olivier Bousque...
122
Voted
MOC
1998
111views more  MOC 1998»
15 years 3 months ago
The approximation power of moving least-squares
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...
David Levin
TALG
2010
158views more  TALG 2010»
14 years 10 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...