Sciweavers

710 search results - page 116 / 142
» On Minimum Power Connectivity Problems
Sort
View
BMCBI
2008
115views more  BMCBI 2008»
13 years 10 months ago
BioGraphE: high-performance bionetwork analysis using the Biological Graph Environment
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
George Chin Jr., Daniel G. Chavarría-Mirand...
IPPS
2009
IEEE
14 years 4 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 10 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
14 years 10 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis
PIMRC
2008
IEEE
14 years 4 months ago
Information theory vs. queueing theory for resource allocation in multiple access channels
— We consider the problem of rate allocation in a fading Gaussian multiple-access channel with fixed transmission powers. The goal is to maximize a general concave utility funct...
Ali ParandehGheibi, Muriel Médard, Asuman E...