Sciweavers

6266 search results - page 51 / 1254
» New results on the computability and complexity of points - ...
Sort
View
TNN
2008
182views more  TNN 2008»
13 years 8 months ago
Large-Scale Maximum Margin Discriminant Analysis Using Core Vector Machines
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...
Ivor Wai-Hung Tsang, András Kocsor, James T...
RECOMB
2006
Springer
14 years 9 months ago
A Study of Accessible Motifs and RNA Folding Complexity
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Zi...
PODC
2012
ACM
11 years 11 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
13 years 9 days ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou
NIPS
2004
13 years 10 months ago
Kernel Projection Machine: a New Tool for Pattern Recognition
This paper investigates the effect of Kernel Principal Component Analysis (KPCA) within the classification framework, essentially the regularization properties of this dimensional...
Laurent Zwald, Régis Vert, Gilles Blanchard...