Sciweavers

1651 search results - page 88 / 331
» Measuring the Complexity of Classification Problems
Sort
View
FSTTCS
1992
Springer
15 years 10 months ago
Structural Average Case Complexity
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Rainer Schuler, Tomoyuki Yamakami
ALT
1999
Springer
15 years 10 months ago
Extended Stochastic Complexity and Minimax Relative Loss Analysis
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
Kenji Yamanishi
CAIP
1999
Springer
140views Image Analysis» more  CAIP 1999»
15 years 10 months ago
Complex Analysis for Reconstruction from Controlled Motion
We address the problem of control-based recovery of robot pose and the environmental lay-out. Panoramic sensors provide us with a 1D projection of characteristic features of a 2D ...
R. Andrew Hicks, David Pettey, Konstantinos Daniil...
TKDE
2002
133views more  TKDE 2002»
15 years 5 months ago
Binary Rule Generation via Hamming Clustering
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
Marco Muselli, Diego Liberati
ISSRE
2007
IEEE
15 years 7 months ago
Data Mining Techniques for Building Fault-proneness Models in Telecom Java Software
This paper describes a study performed in an industrial setting that attempts to build predictive models to identify parts of a Java system with a high probability of fault. The s...
Erik Arisholm, Lionel C. Briand, Magnus Fuglerud