Sciweavers

1651 search results - page 166 / 331
» Measuring the Complexity of Classification Problems
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
Pseudo Likelihood Estimation in Network Tomography
Abstract— Network monitoring and diagnosis are key to improving network performance. The difficulties of performance monitoring lie in today’s fast growing Internet, accompani...
Gang Liang, Bin Yu
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 6 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama
ICALP
2005
Springer
14 years 1 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
13 years 3 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
JMLR
2010
146views more  JMLR 2010»
13 years 2 months ago
Accurate Ensembles for Data Streams: Combining Restricted Hoeffding Trees using Stacking
The success of simple methods for classification shows that is is often not necessary to model complex attribute interactions to obtain good classification accuracy on practical p...
Albert Bifet, Eibe Frank, Geoffrey Holmes, Bernhar...