Sciweavers

315 search results - page 9 / 63
» A General Small Cancellation Theory
Sort
View
CORR
2000
Springer
91views Education» more  CORR 2000»
13 years 7 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
ICML
2004
IEEE
14 years 8 months ago
Margin based feature selection - theory and algorithms
Feature selection is the task of choosing a small set out of a given set of features that capture the relevant properties of the data. In the context of supervised classification ...
Ran Gilad-Bachrach, Amir Navot, Naftali Tishby
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
14 years 1 months ago
Information landscapes and the analysis of search algorithms
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
Yossi Borenstein, Riccardo Poli
SIGCOMM
2010
ACM
13 years 7 months ago
ASTUTE: detecting a different class of traffic anomalies
When many flows are multiplexed on a non-saturated link, their volume changes over short timescales tend to cancel each other out, making the average change across flows close to ...
Fernando Silveira, Christophe Diot, Nina Taft, Ram...
CORR
2011
Springer
185views Education» more  CORR 2011»
12 years 11 months ago
Distributed SIR-Aware Scheduling in Large-Scale Wireless Networks
Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical such algorithms must do so with small...
Chun-Hung Liu, Jeffrey G. Andrews