Sciweavers

2617 search results - page 274 / 524
» Adaptive local ratio
Sort
View
JMLR
2010
143views more  JMLR 2010»
15 years 1 months ago
Rademacher Complexities and Bounding the Excess Risk in Active Learning
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
Vladimir Koltchinskii
SIAMIS
2010
156views more  SIAMIS 2010»
15 years 1 months ago
Learning the Morphological Diversity
This article proposes a new method for image separation into a linear combination of morphological components. Sparsity in fixed dictionaries is used to extract the cartoon and osc...
Gabriel Peyré, Jalal Fadili, Jean-Luc Starc...
SIGMOD
2006
ACM
171views Database» more  SIGMOD 2006»
16 years 7 months ago
Communication-efficient distributed monitoring of thresholded counts
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
Ram Keralapura, Graham Cormode, Jeyashankher Ramam...
ATAL
2003
Springer
16 years 3 hour ago
Information-driven phase changes in multi-agent coordination
Large systems of agents deployed in a real-world environment face threats to their problem solving performance that are independent of the complexity of the problem or the charact...
Sven Brueckner, H. Van Dyke Parunak
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
15 years 10 months ago
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang