5595 search results - page 230 / 1119 » Approximation Algorithms for Clustering Problems |
155
click to vote
DIS
2007
Springer
16 years 16 days ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
194
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
163
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
144
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
183
Voted
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper presents a novel alternative approach, namely weakly supervised learning (WSL), to learn the pre-image of a feature vector in the feature space induced by a kernel. It ...