224 search results - page 21 / 45 » An Efficient Implementation of Braid Groups |
CVPR
2000
IEEE
14 years 8 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...
SIGMOD
2006
ACM
14 years 6 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....
SSDBM
2003
IEEE
14 years 14 hour 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...
DASFAA
2004
IEEE
13 years 10 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
13 years 6 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...