1469 search results - page 228 / 294 » Approximate polynomial decomposition |
216
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
223
click to vote
WEA
2010
Springer
16 years 29 days ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
151
click to vote
SIGECOM
2006
ACM
16 years 3 days ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
153
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
178
Voted
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...