1813 search results - page 122 / 363 » Instance Pruning Techniques |
168
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: p...
240
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Tools for generating test queries for databases do not explicitly take into account the actual data in the database. As a consequence, such tools cannot guarantee suitable coverag...
258
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
174
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
161
click to vote
MICCAI
2009
Springer
16 years 3 months ago
2009
Springer
Automated segmentation of the esophagus in CT images is of high value to radiologists for oncological examinations of the mediastinum. It can serve as a guideline and prevent confu...