1221 search results - page 198 / 245 » Balanced graph partitioning |
153
click to vote
HLK
2003
IEEE
15 years 5 months ago
2003
IEEE
It’s common experience for human vision to perceive full 3D shape and scene from a single 2D image with the occluded parts “filled-in” by prior visual knowledge. In this pa...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
122
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
100
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
For video summarization and retrieval, one of the important modules is to group temporal-spatial coherent shots into high-level semantic video clips namely scene segmentation. In ...
185
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...