Sciweavers

41 search results - page 5 / 9
» On the Construction of One-Way Functions from Average Case H...
Sort
View
MFCS
2005
Springer
14 years 12 days ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 1 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
FOCS
2004
IEEE
13 years 10 months ago
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
Lisa Fleischer, Kamal Jain, Mohammad Mahdian
PC
2007
123views Management» more  PC 2007»
13 years 6 months ago
MPI collective algorithm selection and quadtree encoding
Abstract. In this paper, we focus on MPI collective algorithm selection process and explore the applicability of the quadtree encoding method to this problem. During the algorithm ...
Jelena Pjesivac-Grbovic, George Bosilca, Graham E....
BMCBI
2007
130views more  BMCBI 2007»
13 years 7 months ago
HMM-ModE - Improved classification using profile hidden Markov models by optimising the discrimination threshold and modifying e
Background: Profile Hidden Markov Models (HMM) are statistical representations of protein families derived from patterns of sequence conservation in multiple alignments and have b...
Prashant K. Srivastava, Dhwani K. Desai, Soumyadee...