Sciweavers

1578 search results - page 213 / 316
» Algorithmic randomness of continuous functions
Sort
View
SIAMCOMP
2010
147views more  SIAMCOMP 2010»
13 years 7 months ago
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
14 years 9 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
ATAL
2010
Springer
13 years 10 months ago
Linear options
Learning, planning, and representing knowledge in large state t multiple levels of temporal abstraction are key, long-standing challenges for building flexible autonomous agents. ...
Jonathan Sorg, Satinder P. Singh
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
14 years 9 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu
WONS
2005
IEEE
14 years 2 months ago
Ant Agents for Hybrid Multipath Routing in Mobile Ad Hoc Networks
In this paper we describe AntHocNet, an algorithm for routing in mobile ad hoc networks based on ideas from the Nature-inspired Ant Colony Optimization framework. The algorithm co...
Frederick Ducatelle, Gianni Di Caro, Luca Maria Ga...