Sciweavers

195 search results - page 11 / 39
» On the Supports of Recognizable Timed Series
Sort
View
COCOON
1999
Springer
13 years 11 months ago
Distributionally-Hard Languages
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
Lance Fortnow, Aduri Pavan, Alan L. Selman
ICDM
2009
IEEE
200views Data Mining» more  ICDM 2009»
13 years 5 months ago
Improving SVM Classification on Imbalanced Data Sets in Distance Spaces
Abstract--Imbalanced data sets present a particular challenge to the data mining community. Often, it is the rare event that is of interest and the cost of misclassifying the rare ...
Suzan Koknar-Tezel, Longin Jan Latecki
ICSE
2008
IEEE-ACM
14 years 8 months ago
Are fit tables really talking?: a series of experiments to understand whether fit tables are useful during evolution tasks
Test-driven software development tackles the problem of operationally defining the features to be implemented by means of test cases. This approach was recently ported to the earl...
Filippo Ricca, Massimiliano Di Penta, Marco Torchi...
JASIS
2000
121views more  JASIS 2000»
13 years 7 months ago
Genres and the WEB: Is the personal home page the first uniquely digital genre?
Genre conventions emerge across discourse communities over time to support the communication of ideas and information in socially and cognitively compatible forms. Digital genres ...
Andrew Dillon, Barbara A. Gushrowski
NIPS
1998
13 years 8 months ago
Using Analytic QP and Sparseness to Speed Training of Support Vector Machines
Training a Support Vector Machine (SVM) requires the solution of a very large quadratic programming (QP) problem. This paper proposes an algorithm for training SVMs: Sequential Mi...
John C. Platt