11214 search results - page 241 / 2243 » Just-in-time data structures |
97
Voted
DCC
2008
IEEE
15 years 7 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...
106
click to vote
ICDAR
2011
IEEE
14 years 12 days ago
2011
IEEE
—We introduce quantization feature functions to represent continuous or large range discrete data into the symbolic CRF data representation. We show that doing this convertion in...
62
Voted
IJNVO
2011
14 years 7 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 ...
130
Voted
CACM
1998
15 years 15 days 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...
118
click to vote
SODA
2004
ACM
15 years 2 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...