Sciweavers

1389 search results - page 92 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
JCSS
2010
146views more  JCSS 2010»
15 years 1 months ago
Connected facility location via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
ICALP
2010
Springer
15 years 8 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
16 years 3 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
ICML
2010
IEEE
15 years 4 months ago
Large Scale Max-Margin Multi-Label Classification with Priors
We propose a max-margin formulation for the multi-label classification problem where the goal is to tag a data point with a set of pre-specified labels. Given a set of L labels, a...
Bharath Hariharan, Lihi Zelnik-Manor, S. V. N. Vis...
EUSFLAT
2009
137views Fuzzy Logic» more  EUSFLAT 2009»
15 years 26 days ago
Novel Methods for the Design of General Type-2 Fuzzy Sets based on Device Characteristics and Linguistic Labels Surveys
Fuzzy Logic Systems are widely recognized to be successful at modelling uncertainty in a large variety of applications. While recently interval type-2 fuzzy logic has been credited...
Christian Wagner, Hani Hagras