Sciweavers

2706 search results - page 511 / 542
» The case for a new business model
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
WCNC
2010
IEEE
13 years 11 months ago
Hedonic Coalition Formation Games for Secondary Base Station Cooperation in Cognitive Radio Networks
— In order to maintain a conflict-free environment among licensed primary users (PUs) and unlicensed secondary users (SUs) in cognitive radio networks, providing frequency and g...
Walid Saad, Zhu Han, Tamer Basar, Are Hjøru...
CODES
2006
IEEE
13 years 11 months ago
Phase guided sampling for efficient parallel application simulation
Simulating chip-multiprocessor systems (CMP) can take a long time. For single-threaded workloads, earlier work has shown the utility of phase analysis, that is identification of r...
Jeffrey Namkung, Dohyung Kim, Rajesh K. Gupta, Igo...
COLT
2006
Springer
13 years 11 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
AAI
2007
132views more  AAI 2007»
13 years 7 months ago
Incremental Extraction of Association Rules in Applicative Domains
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
Arianna Gallo, Roberto Esposito, Rosa Meo, Marco B...