2969 search results - page 105 / 594 » A space efficient algorithm for group structure computation |
SHAPE
1999
Springer
15 years 7 months ago
1999
Springer
The objective of this work is the automatic detection and grouping of imaged elements which repeat in a scene. We show that structures that repeat in the world (for example wall p...
178
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
129
click to vote
CGF
2004
15 years 3 months ago
2004
We address in this paper the issue of computing diffuse global illumination solutions for animation sequences. The principal difficulties lie in the computational complexity of gl...
125
Voted
EUMAS
2006
15 years 4 months ago
2006
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that...
102
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
In this paper, we describe a technique to temporally sort a collection of photos that span many years. By reasoning about persistence of visible structures, we show how this sorti...