Sciweavers

518 search results - page 49 / 104
» Beating a Random Assignment
Sort
View
MCS
2007
Springer
15 years 8 months ago
Selecting Diversifying Heuristics for Cluster Ensembles
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva
BMCBI
2007
166views more  BMCBI 2007»
15 years 2 months ago
Optimization of filtering criterion for SEQUEST database searching to improve proteome coverage in shotgun proteomics
Background: In proteomic analysis, MS/MS spectra acquired by mass spectrometer are assigned to peptides by database searching algorithms such as SEQUEST. The assignations of pepti...
Xinning Jiang, Xiaogang Jiang, Guanghui Han, Mingl...
CRV
2009
IEEE
237views Robotics» more  CRV 2009»
15 years 9 months ago
SEC: Stochastic Ensemble Consensus Approach to Unsupervised SAR Sea-Ice Segmentation
The use of synthetic aperture radar (SAR) has become an integral part of sea-ice monitoring and analysis in the polar regions. An important task in sea-ice analysis is to segment ...
Alexander Wong, David A. Clausi, Paul W. Fieguth
116
Voted
FOCS
2009
IEEE
15 years 9 months ago
Dynamic and Non-uniform Pricing Strategies for Revenue Maximization
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna
128
Voted
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
15 years 9 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang