Sciweavers

10 search results - page 2 / 2
» Monotone Conditional Complexity Bounds on Future Prediction ...
Sort
View
STACS
1999
Springer
13 years 9 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
UAI
1998
13 years 6 months ago
Tractable Inference for Complex Stochastic Processes
The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system,...
Xavier Boyen, Daphne Koller
ICVS
1999
Springer
13 years 9 months ago
Action Reaction Learning: Automatic Visual Analysis and Synthesis of Interactive Behaviour
We propose Action-Reaction Learning as an approach for analyzing and synthesizing human behaviour. This paradigm uncovers causal mappings between past and future events or between...
Tony Jebara, Alex Pentland
ICDM
2010
IEEE
150views Data Mining» more  ICDM 2010»
13 years 3 months ago
Probabilistic Inference Protection on Anonymized Data
Background knowledge is an important factor in privacy preserving data publishing. Probabilistic distributionbased background knowledge is a powerful kind of background knowledge w...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang, Y...
BROADNETS
2004
IEEE
13 years 9 months ago
The Effects of the Sub-Carrier Grouping on Multi-Carrier Channel Aware Scheduling
Channel-aware scheduling and link adaptation (LA) methods are widely considered to be crucial for realizing high data rates in wireless networks. Multi-carrier systems that spread...
Fanchun Jin, Gokhan Sahin, Amrinder Arora, Hyeong-...