Sciweavers

2652 search results - page 313 / 531
» Privacy-preserving linear programming
Sort
View
IAT
2009
IEEE
15 years 10 months ago
Clustering with Constrained Similarity Learning
—This paper proposes a method of learning a similarity matrix from pairwise constraints for interactive clustering. The similarity matrix can be learned by solving an optimizatio...
Masayuki Okabe, Seiji Yamada
ICC
2009
IEEE
150views Communications» more  ICC 2009»
15 years 10 months ago
Optimum Internet Gateway Selection in Ad Hoc Networks
—Wireless ad hoc networks are connected to the fixed Internet by means of Internet gateways. Whenever a node within the ad hoc network wishes to communicate with a host in the I...
Felix Hoffmann, Daniel Medina
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
15 years 10 months ago
Small-Bias Spaces for Group Products
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
Raghu Meka, David Zuckerman
115
Voted
PKDD
2009
Springer
113views Data Mining» more  PKDD 2009»
15 years 10 months ago
Feature Selection for Density Level-Sets
A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an e...
Marius Kloft, Shinichi Nakajima, Ulf Brefeld
129
Voted
SSS
2009
Springer
162views Control Systems» more  SSS 2009»
15 years 10 months ago
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
André Schumacher, Harri Haanpää