Sciweavers

7129 search results - page 333 / 1426
» Approximation Algorithms for Treewidth
Sort
View
JMLR
2010
164views more  JMLR 2010»
14 years 11 months ago
Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms
The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...
Nevena Lazic, Brendan J. Frey, Parham Aarabi
FOCS
2009
IEEE
15 years 11 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
166
Voted
INFOCOM
2009
IEEE
15 years 11 months ago
Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
Chee-Wei Tan, Mung Chiang, R. Srikant
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
15 years 10 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
ISMIS
2005
Springer
15 years 10 months ago
Incremental Collaborative Filtering for Highly-Scalable Recommendation Algorithms
Most recommendation systems employ variations of Collaborative Filtering (CF) for formulating suggestions of items relevant to users’ interests. However, CF requires expensive co...
Manos Papagelis, Ioannis Rousidis, Dimitris Plexou...