Sciweavers

358 search results - page 67 / 72
» Sparse squares of polynomials
Sort
View
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 7 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
TSP
2008
117views more  TSP 2008»
13 years 7 months ago
A Theory for Sampling Signals From a Union of Subspaces
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...
Yue M. Lu, Minh N. Do
ICCV
2011
IEEE
12 years 7 months ago
The Power of Comparative Reasoning
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
Jay Yagnik, Dennis Strelow, David Ross, Ruei-sung ...
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 7 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
SIAMSC
2008
123views more  SIAMSC 2008»
13 years 7 months ago
Balanced Incomplete Factorization
In this paper we present a new incomplete factorization of a square matrix into triangular factors in which we get standard LU or LDLT factors (direct factors) and their inverses (...
Rafael Bru, José Marín, José ...