11211 search results - page 272 / 2243 » Rank-Sensitive Data Structures |
150
click to vote
DCC
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we introduce an adaptive technique for compressing small quantities of text which are organized as a rooted directed graph. We impose a constraint on the technique s...
118
click to vote
IJNVO
2011
15 years 1 months ago
2011
: Data collection of covert networks is an inherently difficult task because of the very nature of these networks. Researchers find it difficult to locate and access data relating ...
201
click to vote
CACM
1998
15 years 6 months ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
195
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
164
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this pap...