Sciweavers

1772 search results - page 76 / 355
» Classifying Problems into Complexity Classes
Sort
View
AAAI
2008
15 years 2 months ago
Classification by Discriminative Regularization
Classification is one of the most fundamental problems in machine learning, which aims to separate the data from different classes as far away as possible. A common way to get a g...
Bin Zhang, Fei Wang, Ta-Hsin Li, Wen Jun Yin, Jin ...
108
Voted
NN
2000
Springer
161views Neural Networks» more  NN 2000»
15 years 10 days ago
How good are support vector machines?
Support vector (SV) machines are useful tools to classify populations characterized by abrupt decreases in density functions. At least for one class of Gaussian data model the SV ...
Sarunas Raudys
95
Voted
CORR
2007
Springer
124views Education» more  CORR 2007»
15 years 16 days ago
Graph-Based Decoding in the Presence of ISI
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...
Mohammad H. Taghavi, Paul H. Siegel
105
Voted
COCO
2006
Springer
97views Algorithms» more  COCO 2006»
15 years 4 months ago
Grid Graph Reachability Problems
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
Eric Allender, David A. Mix Barrington, Tanmoy Cha...
CGO
2007
IEEE
15 years 7 months ago
On the Complexity of Register Coalescing
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
Florent Bouchez, Alain Darte, Fabrice Rastello