5100 search results - page 589 / 1020 » The Linear Complexity of a Graph |
220
click to vote
NIPS
2004
15 years 8 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
156
click to vote
NIPS
2001
15 years 8 months ago
2001
Support Vector Machines (SVMs) are currently the state-of-the-art models for many classication problems but they suer from the complexity of their training algorithm which is at l...
156
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: Bioactivity profiling using high-throughput in vitro assays can reduce the cost and time required for toxicological screening of environmental chemicals and can also r...
156
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...
176
click to vote
DCG
2006
15 years 6 months ago
2006
We propose an algorithm to compute a conforming Delaunay mesh of a bounded domain specified by a piecewise linear complex. Arbitrarily small input angles are allowed, and the inpu...