1004 search results - page 182 / 201 » Product representations of polynomials |
95
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
119
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
118
click to vote
ICCAD
2002
IEEE
15 years 10 months ago
2002
IEEE
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
127
click to vote
SAC
2010
ACM
15 years 8 months ago
2010
ACM
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
120
click to vote
WABI
2009
Springer
15 years 8 months ago
2009
Springer
We present biRNA, a novel algorithm for prediction of binding sites between two RNAs based on minimization of binding free energy. Similar to RNAup approach [30], we assume the bin...