Sciweavers

2434 search results - page 46 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
EOR
2007
101views more  EOR 2007»
15 years 1 months ago
Optimizing an objective function under a bivariate probability model
The motivation of this paper is to obtain an analytical closed form of a quadratic objective function arising from a stochastic decision process with bivariate exponential probabi...
Xavier Brusset, Nico M. Temme
GPEM
2007
119views more  GPEM 2007»
15 years 1 months ago
Genomic mining for complex disease traits with "random chemistry"
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
Margaret J. Eppstein, Joshua L. Payne, Bill C. Whi...
CSR
2007
Springer
15 years 8 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
PIMRC
2010
IEEE
14 years 12 months ago
Asymptotic analysis of distributed multi-cell beamforming
We consider the problem of multi-cell downlink beamforming with N cells and K terminals per cell. Cooperation among base stations (BSs) has been found to increase the system throug...
Subhash Lakshminaryana, Jakob Hoydis, Mérou...
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
15 years 10 days ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer