Sciweavers

774 search results - page 110 / 155
» A subdivision-based algorithm for the sparse resultant
Sort
View
ISSAC
2007
Springer
106views Mathematics» more  ISSAC 2007»
15 years 7 months ago
Numerical techniques for computing the inertia of products of matrices of rational numbers
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...
John P. May, B. David Saunders, David Harlan Wood
DCOSS
2009
Springer
15 years 6 months ago
Local Construction of Spanners in the 3-D Space
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...
Iyad A. Kanj, Ge Xia, Fenghui Zhang
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
15 years 5 months ago
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs
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...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
117
Voted
ICML
2010
IEEE
15 years 2 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
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 ...
Noam Goldberg, Jonathan Eckstein
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 1 months ago
Linear Programming Boosting via Column Generation
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...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...