2736 search results - page 303 / 548 » Indexing uncertain data |
183
click to vote
ICDE
2007
IEEE
16 years 25 days ago
2007
IEEE
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
193
click to vote
FLAIRS
2007
15 years 8 months ago
2007
Clustering attempts to discover significant groups present in a data set. It is an unsupervised process. It is difficult to define when a clustering result is acceptable. Thus,...
161
click to vote
FLAIRS
2004
15 years 8 months ago
2004
We propose a new approach for learning Bayesian classifiers from data. Although it relies on traditional Bayesian network (BN) learning algorithms, the effectiveness of our approa...
172
click to vote
IR
2008
15 years 6 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...
218
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...