Sciweavers

681 search results - page 59 / 137
» General Polynomial Time Decomposition Algorithms
Sort
View
117
Voted
SIGECOM
2003
ACM
134views ECommerce» more  SIGECOM 2003»
15 years 5 months ago
Correlated equilibria in graphical games
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
Sham Kakade, Michael J. Kearns, John Langford, Lui...
99
Voted
BMCBI
2006
115views more  BMCBI 2006»
15 years 16 days ago
Multivariate curve resolution of time course microarray data
Background: Modeling of gene expression data from time course experiments often involves the use of linear models such as those obtained from principal component analysis (PCA), i...
Peter D. Wentzell, Tobias K. Karakach, Sushmita Ro...
AMAI
2008
Springer
15 years 18 days ago
Recognition of interval Boolean functions
Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. Their ...
Ondrej Cepek, David Kronus, Petr Kucera
FOCS
2005
IEEE
15 years 6 months ago
Learning mixtures of product distributions over discrete domains
We consider the problem of learning mixtures of product distributions over discrete domains in the distribution learning framework introduced by Kearns et al. [18]. We give a poly...
Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
120
Voted
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
14 years 10 months 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