Sciweavers

1301 search results - page 52 / 261
» Bounded Version Vectors
Sort
View
BMCBI
2007
147views more  BMCBI 2007»
15 years 4 months ago
Improved residue contact prediction using support vector machines and a large feature set
Background: Predicting protein residue-residue contacts is an important 2D prediction task. It is useful for ab initio structure prediction and understanding protein folding. In s...
Jianlin Cheng, Pierre Baldi
CORR
2006
Springer
85views Education» more  CORR 2006»
15 years 3 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil
SIAMCOMP
2000
86views more  SIAMCOMP 2000»
15 years 3 months ago
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...
ICONIP
2007
15 years 5 months ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor
149
Voted
CORR
2010
Springer
138views Education» more  CORR 2010»
15 years 3 months ago
Shallow Circuits with High-Powered Inputs
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
Pascal Koiran