1416 search results - page 210 / 284 » Optimizing Write Performance for Read Optimized Databases |
108
click to vote
DKE
2006
14 years 12 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
108
click to vote
ISI
2008
Springer
14 years 12 months ago
2008
Springer
Pervasive information systems give an overview of what digital environments should look like in the future. From a data-centric point of view, traditional databases have to be used...
TCBB
2008
14 years 11 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
150
click to vote
PR
2007
14 years 11 months ago
2007
We present a shape representation and a matching method for nonrigid shapes with closed contours. The representation utilizes the areas of the triangles formed by the boundary poi...
ICPR
2010
IEEE
14 years 9 months ago
2010
IEEE
Unlike most previous manifold-based data classification algorithms assume that all the data points are on a single manifold, we expect that data from different classes may reside ...