699 search results - page 74 / 140 » Generalized Distance Functions in the Theory of Computation |
JCB
2008
14 years 9 months ago
2008
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
IWMM
2009
Springer
15 years 4 months ago
2009
Springer
Good spatial locality alleviates both the latency and bandwidth problem of memory by boosting the effect of prefetching and improving the utilization of cache. However, convention...
105
click to vote
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
In the last decade, a great deal of work has been devoted to the elaboration of a sampling theory for smooth surfaces. The goal was to ensure a good reconstruction of a given surf...
163
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...