Sciweavers

217 search results - page 22 / 44
» A new upper bound on the cyclic chromatic number
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 11 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
COMPGEOM
2010
ACM
13 years 10 months ago
Tangencies between families of disjoint regions in the plane
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the memb...
János Pach, Andrew Suk, Miroslav Treml
CAAN
2007
Springer
13 years 11 months ago
Nonadaptive Selfish Routing with Online Demands
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
Tobias Harks, László A. Végh
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 2 months ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 7 months ago
High Rate Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
—Distributed orthogonal space–time block codes (DOSTBCs) achieving full-diversity order and single-symbol maximum-likelihood (ML) decodability have been introduced recently by ...
Jagadeesh Harshan, B. Sundar Rajan