Sciweavers

27 search results - page 3 / 6
» Polynomial-Time Algorithms for the Ordered Maximum Agreement...
Sort
View
ESA
2008
Springer
83views Algorithms» more  ESA 2008»
13 years 7 months ago
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what o...
Samir Khuller, Julián Mestre
INFOCOM
2006
IEEE
13 years 11 months ago
Maximum Throughput and Fair Bandwidth Allocation in Multi-Channel Wireless Mesh Networks
— Wireless mesh network is designed as an economical solution for last-mile broadband Internet access. In this paper, we study bandwidth allocation in multi-channel multihop wire...
Jian Tang, Guoliang Xue, Weiyi Zhang
JCB
2006
140views more  JCB 2006»
13 years 5 months ago
HAPLOFREQ-Estimating Haplotype Frequencies Efficiently
A commonly used tool in disease association studies is the search for discrepancies between the haplotype distribution in the case and control populations. In order to find this d...
Eran Halperin, Elad Hazan
EDBT
2011
ACM
231views Database» more  EDBT 2011»
12 years 9 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 5 months ago
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...