774 search results - page 110 / 155 » A subdivision-based algorithm for the sparse resultant |
111
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
Consider a rational matrix, particularly one whose entries have large numerators and denominators, but which is presented as a product of very sparse matrices with relatively smal...
141
click to vote
DCOSS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
131
click to vote
STOC
1998
ACM
15 years 8 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
135
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
150
click to vote
ML
2002
ACM
15 years 3 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...