2635 search results - page 285 / 527 » Algorithms for the Database Layout Problem |
208
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
"Inside information" comes in many forms: knowledge of a corporate takeover, a terrorist attack, unexpectedly poor earnings, the FDA's acceptance of a new drug, etc...
143
click to vote
CIARP
2005
Springer
16 years 4 days ago
2005
Springer
The KNN rule has been widely used in many pattern recognition problems, but it is sensible to noisy data within the training set, therefore, several sample edition methods have bee...
192
click to vote
SSD
2005
Springer
16 years 2 days ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
168
click to vote
CINQ
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
169
click to vote
CVPR
2010
IEEE
15 years 12 months ago
2010
IEEE
Real-world face recognition systems often have to face the single sample per person (SSPP) problem, that is, only a single training sample for each person is enrolled in the datab...