5746 search results - page 449 / 1150 » Visualizing Query Structure |
214
click to vote
DAGM
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. In this paper, we propose a new approach to learn structured visual compound models from shape-based feature descriptions. We use captioned text in order to drive the pro...
182
Voted
CLA
2004
15 years 9 months ago
2004
Traditional framework for mining association rules has pointed out the derivation of many redundant rules. In order to be reliable in a decision making process, such discovered rul...
294
click to vote
PODS
2009
ACM
16 years 8 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
301
click to vote
ICDE
2007
IEEE
16 years 9 months ago
2007
IEEE
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
296
click to vote
SIGMOD
2006
ACM
16 years 7 months ago
2006
ACM
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...