Sciweavers

11214 search results - page 232 / 2243
» Just-in-time data structures
Sort
View
JAIR
2008
173views more  JAIR 2008»
15 years 22 days ago
Creating Relational Data from Unstructured and Ungrammatical Data Sources
In order for agents to act on behalf of users, they will have to retrieve and integrate vast amounts of textual data on the World Wide Web. However, much of the useful data on the...
Matthew Michelson, Craig A. Knoblock
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
15 years 5 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
79
Voted
WWW
2003
ACM
16 years 1 months ago
Data-Sharing Relationships in the Web
We propose a novel structure, the data-sharing graph, for characterizing sharing patterns in large-scale data distribution systems. We analyze this structure in two such systems a...
Adriana Iamnitchi, Matei Ripeanu, Ian T. Foster
96
Voted
INFOVIS
2002
IEEE
15 years 5 months ago
Multiple Foci Drill-Down through Tuple and Attribute Aggregation Polyarchies in Tabular Data
Information analysis often involves decomposing data into sub-groups to allow for comparison and identification of relationships. Breakdown Visualization provides a mechanism to s...
Nathan Conklin, Sandeep Prabhakar, Chris North
UAI
1998
15 years 2 months ago
A Multivariate Discretization Method for Learning Bayesian Networks from Mixed Data
In this paper we address the problem of discretization in the context of learning Bayesian networks (BNs) from data containing both continuous and discrete variables. We describe ...
Stefano Monti, Gregory F. Cooper