2969 search results - page 312 / 594 » A space efficient algorithm for group structure computation |
136
click to vote
ICPADS
2005
IEEE
15 years 10 months ago
2005
IEEE
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
114
click to vote
ICPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Conventional clustering techniques provide a static snapshot of each vector's commitment to every group. With additive datasets, however, existing methods may not be sufficie...
127
click to vote
WIKIS
2005
ACM
15 years 10 months ago
2005
ACM
In this article we examine the integration of communities of practice supported by a wiki into work processes. Linear structures are often inappropriate for the execution of knowl...
139
click to vote
CONCUR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...
230
click to vote
ICDE
2004
IEEE
16 years 6 months ago
2004
IEEE
In this paper, we introduce the concept of a QA-Pagelet to refer to the content region in a dynamic page that contains query matches. We present THOR, a scalable and efficient min...