Sciweavers

415 search results - page 14 / 83
» An efficient approximation for the Generalized Assignment Pr...
Sort
View
SPAA
2003
ACM
14 years 1 months ago
The load rebalancing problem
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
Gagan Aggarwal, Rajeev Motwani, An Zhu
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
14 years 8 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
13 years 9 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
ATAL
2008
Springer
13 years 10 months ago
Efficient approximate inference in distributed Bayesian networks for MAS-based sensor interpretation
The multiply sectioned Bayesian network (MSBN) framework is the most studied approach for distributed Bayesian Network inference in an MAS setting. This paper describes a new fram...
Norman Carver
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
14 years 8 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb