Sciweavers

35 search results - page 6 / 7
» Process inheritance and instance modification
Sort
View
SAC
2006
ACM
14 years 3 days ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 6 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
CIE
2007
Springer
14 years 10 days ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
BMCBI
2008
133views more  BMCBI 2008»
13 years 6 months ago
LocateP: Genome-scale subcellular-location predictor for bacterial proteins
Background: In the past decades, various protein subcellular-location (SCL) predictors have been developed. Most of these predictors, like TMHMM 2.0, SignalP 3.0, PrediSi and Phob...
Miaomiao Zhou, Jos Boekhorst, Christof Francke, Ro...
BMCBI
2007
178views more  BMCBI 2007»
13 years 6 months ago
SVM clustering
Background: Support Vector Machines (SVMs) provide a powerful method for classification (supervised learning). Use of SVMs for clustering (unsupervised learning) is now being cons...
Stephen Winters-Hilt, Sam Merat