224 search results - page 21 / 45 » An Efficient Implementation of Braid Groups |
CVPR
2000
IEEE
16 years 1 months ago
2000
IEEE
We present a new image segmentation algorithm based on graph cuts. Our main tool is separation of each pixel from a special point outside the image by a cut of a minimum cost. Suc...
166
click to vote
SIGMOD
2006
ACM
15 years 11 months ago
2006
ACM
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
104
click to vote
SSDBM
2003
IEEE
15 years 4 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
126
click to vote
DASFAA
2004
IEEE
15 years 2 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
JCP
2006
14 years 11 months ago
2006
Abstract-- This work aims to pave the way for high availability in high-performance computing (HPC) by focusing on efficient redundancy strategies for head and service nodes. These...