14 search results - page 2 / 3 » Lower Bounds for Maximum Parsimony with Gene Order Data |
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
SIROCCO
2003
13 years 6 months ago
2003
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
PAMI
2008
13 years 5 months ago
2008
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...