2969 search results - page 328 / 594 » A space efficient algorithm for group structure computation |
152
click to vote
CPM
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
133
click to vote
CGF
2004
15 years 4 months ago
2004
In recent years it has been shown that, above a certain complexity, points become the most efficient rendering primitives. Although the programmability of the lastest graphics har...
127
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
139
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
The calculation of salient structures is one of the early and basic ideas of perceptual organization in Computer Vision. Saliency algorithms typically mark edge-points with some s...
135
click to vote
GROUP
2003
ACM
15 years 10 months ago
2003
ACM
We describe a new collaborative technology that is mid-way between the informality of email and the formality of shared workspaces. Email and other ad hoc collaboration systems ar...