Sciweavers

3433 search results - page 147 / 687
» Heuristics for a bidding problem
Sort
View
IJISEC
2006
108views more  IJISEC 2006»
15 years 6 months ago
How to obtain full privacy in auctions
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
Felix Brandt
COCOON
2009
Springer
15 years 10 months ago
Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection
Multiple reaction monitoring (MRM) is a mass spectrometric method to quantify a specified set of proteins. In this paper, we identify a problem at the core of MRM peptide quantific...
Rastislav Srámek, Bernd Fischer, Elias Vica...
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
15 years 8 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
VTC
2006
IEEE
112views Communications» more  VTC 2006»
16 years 16 days ago
Adaptive Resource Allocation Based on Channel Information in Multihop OFDM Systems
— In this paper, we investigate the adaptive resource allocation problem in multiuser multihop OFDM systems. Assuming that base station(BS) knows all channel information, we form...
ChiSung Bae, Dong-Ho Cho
INFOCOM
2010
IEEE
15 years 5 months ago
Utility Maximization for Delay Constrained QoS in Wireless
Abstract—This paper studies the problem of utility maximization for clients with delay based QoS requirements in wireless networks. We adopt a model used in a previous work that ...
I-Hong Hou, P. R. Kumar