Sciweavers

667 search results - page 97 / 134
» Approximation algorithms for connected facility location pro...
Sort
View
RECOMB
2008
Springer
16 years 25 days ago
Constructing Treatment Portfolios Using Affinity Propagation
A key problem of interest to biologists and medical researchers is the selection of a subset of queries or treatments that provide maximum utility for a population of targets. For ...
Delbert Dueck, Brendan J. Frey, Nebojsa Jojic, Vla...
97
Voted
GD
1998
Springer
15 years 4 months ago
Using Graph Layout to Visualize Train Interconnection Data
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
Ulrik Brandes, Dorothea Wagner
119
Voted
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 1 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
TKDE
2012
199views Formal Methods» more  TKDE 2012»
13 years 2 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
85
Voted
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 25 days ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson