2635 search results - page 310 / 527 » Algorithms for the Database Layout Problem |
210
click to vote
ADC
2003
Springer
15 years 11 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
153
click to vote
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
167
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
Fingerprint matching is one of the most important modules in automatic fingerprint identification systems (AFIS). Traditional methods treat this problem as point pattern matching,...
161
click to vote
ER
2007
Springer
16 years 22 days ago
2007
Springer
Processing a twig pattern query in XML document includes structural search and content search. Most existing algorithms only focus on structural search. They treat content nodes th...
190
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
High throughput biotechnologies have enabled scientists to collect a large number of genetic and phenotypic attributes for a large collection of samples. Computational methods are...