461 search results - page 86 / 93 » Practical polynomial factoring in polynomial time |
SODA
2010
ACM
14 years 4 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...
SAC
2010
ACM
14 years 2 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...
ESA
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
ISAAC
2003
Springer
14 years 17 days ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...