8294 search results - page 1299 / 1659 » Presenting Data from Experiments in Algorithmics |
168
click to vote
DGO
2007
15 years 6 months ago
2007
We present D-HOTM, a framework for Distributed Higher Order Text Mining based on named entities extracted from textual data that are stored in distributed relational databases. Unl...
150
click to vote
SDM
2008
SIAM
15 years 6 months ago
2008
SIAM
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
171
click to vote
UAI
2001
15 years 6 months ago
2001
In this paper we present a method of computing the posterior probability of conditional independence of two or more continuous variables from data, examined at several resolutions...
162
Voted
UAI
1996
15 years 6 months ago
1996
This paper presents a Bayesian approach to learning the connectivity structure of a group of neurons from data on configuration frequencies. A major objective of the research is t...
149
click to vote
IR
2008
15 years 4 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...