65 search results - page 12 / 13 » Local structure and determinism in probabilistic databases |
KDD
2009
ACM
14 years 5 months ago
2009
ACM
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
AIM
2005
13 years 4 months ago
2005
Intelligent access to information requires semantic integration of structured databases with unstructured textual resources. While the semantic integration problem has been widely...
GREC
2007
Springer
13 years 8 months ago
2007
Springer
Computer understanding of visual languages in pen-based environments requires a combination of lexical analysis in which the basic tokens are recognized from hand-drawn gestures an...
ICDT
2010
ACM
13 years 3 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
ECCV
2002
Springer
14 years 6 months ago
2002
Springer
This paper presents a novel approach for detecting affine invariant interest points. Our method can deal with significant affine transformations including large scale changes. Such...