2141 search results - page 252 / 429 » A distance model for rhythms |
287
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
171
click to vote
SODA
2010
ACM
16 years 3 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...
177
click to vote
BIBE
2007
IEEE
16 years 24 days ago
2007
IEEE
Abstract—Because of the advent of high-throughput sequencing and the consequent reduction in cost of sequencing, many organisms have been completely sequenced and most of their g...
186
click to vote
INFOCOM
2007
IEEE
16 years 23 days ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
190
click to vote
STACS
2007
Springer
16 years 17 days ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...