Sciweavers

867 search results - page 6 / 174
» The Generalized Maximum Coverage Problem
Sort
View
NIPS
1996
13 years 9 months ago
Maximum Likelihood Blind Source Separation: A Context-Sensitive Generalization of ICA
In the square linear blind source separation problem, one must nd a linear unmixing operator which can detangle the result xi(t) of mixing n unknown independent sources si(t) thro...
Barak A. Pearlmutter, Lucas C. Parra
ESCIENCE
2006
IEEE
13 years 11 months ago
A Differential Evolution Based Algorithm to Optimize the Radio Network Design Problem
In this paper we present a Differential Evolution based algorithm used to solve the Radio Network Design (RND) problem. This problem consists in determining the optimal locations ...
Silvio Priem-Mendes, Juan Antonio Gómez Pul...
STOC
2007
ACM
164views Algorithms» more  STOC 2007»
14 years 8 months ago
All-pairs bottleneck paths for general graphs in truly sub-cubic time
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
Virginia Vassilevska, Ryan Williams, Raphael Yuste...
DAM
2006
87views more  DAM 2006»
13 years 7 months ago
A new trust region technique for the maximum weight clique problem
A new simple generalization of the Motzkin
Stanislav Busygin
WINE
2005
Springer
135views Economy» more  WINE 2005»
14 years 1 months ago
On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams
Owing to numerous potential applications, wireless sensor networks have been the focus of a lot of research efforts lately. In this note we study one fundamental issue in such net...
Anthony Man-Cho So, Yinyu Ye