Sciweavers

3244 search results - page 273 / 649
» On convex complexity measures
Sort
View
ICPR
2004
IEEE
16 years 7 months ago
On Classifier Domains of Competence
We study the domain of dominant competence of six popular classifiers in a space of data complexity measurements. We observe that the simplest classifiers, nearest neighbor and li...
Ester Bernadó i Mansilla, Tin Kam Ho
DAC
2004
ACM
16 years 7 months ago
Synthesizing interconnect-efficient low density parity check codes
Error correcting codes are widely used in communication and storage applications. Codec complexity has usually been measured with a software implementation in mind. A recent hardw...
Marghoob Mohiyuddin, Amit Prakash, Adnan Aziz, Way...
SIGSOFT
2005
ACM
16 years 7 months ago
Moose: an agile reengineering environment
Software systems are complex and difficult to analyze. Reengineering is a complex activity that usually involves combining different techniques and tools. Moose is an reengineerin...
Oscar Nierstrasz, Stéphane Ducasse, Tudor G...
SIGSOFT
2005
ACM
16 years 7 months ago
The story of moose: an agile reengineering environment
Moose is a language-independent environment for reverseand re-engineering complex software systems. Moose provides a set of services including a common meta-model, metrics evaluat...
Oscar Nierstrasz, Stéphane Ducasse, Tudor G...
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
16 years 7 months ago
Model compression
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...
Cristian Bucila, Rich Caruana, Alexandru Niculescu...