Sciweavers

395 search results - page 78 / 79
» Polynomial Approximations for Model Checking
Sort
View
SASN
2003
ACM
13 years 11 months ago
Location-based pairwise key establishments for static sensor networks
Sensor networks are ideal candidates for applications such as target tracking and environment monitoring. Security in sensor networks is critical when there are potential adversar...
Donggang Liu, Peng Ning
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 9 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
ECCC
2010
124views more  ECCC 2010»
13 years 5 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
CGF
2005
156views more  CGF 2005»
13 years 5 months ago
Efficient Animation of Point-Sampled Thin Shells
We present a novel framework for the efficient simulation and animation of discrete thin shells. Our method takes a point sampled surface as input and performs all necessary compu...
Martin Wicke, Denis Steinemann, Markus H. Gross
WINE
2010
Springer
129views Economy» more  WINE 2010»
13 years 3 months ago
Optimal Pricing in the Presence of Local Network Effects
We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that c...
Ozan Candogan, Kostas Bimpikis, Asuman E. Ozdaglar