244 search results - page 28 / 49 » Fast Set Intersection in Memory |
155
click to vote
PG
2003
IEEE
15 years 11 months ago
2003
IEEE
We present a novel approach for adaptively grouping and subdividing hair using discrete level-of-detail (LOD) representations. The set of discrete LODs include hair strands, clust...
166
click to vote
ICIP
2000
IEEE
15 years 10 months ago
2000
IEEE
Gradual transitions represent a challenging problem for temporal segmentation of video. Here we present two new features for detecting these. Recently, Ngo et al. set out a method...
190
click to vote
FOCS
2008
IEEE
16 years 10 days ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
144
Voted
ICIP
2005
IEEE
16 years 7 months ago
2005
IEEE
We reconstruct geometry for a time-varying scene given by a number of video sequences. The dynamic geometry is represented by a 3D hypersurface embedded in space-time. The interse...
160
click to vote
VLDB
1998
ACM
15 years 10 months ago
1998
ACM
The query execution engine in Microsoft SQL Server employs hash-based algorithms for inner and outer joins, semi-joins, set operations (such as intersection), grouping, and duplic...