9871 search results - page 221 / 1975 » On the Structure of Low Sets |
167
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
178
click to vote
TCS
2008
15 years 6 months ago
2008
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
220
click to vote
PAMI
2010
15 years 1 months ago
2010
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithms...
206
click to vote
LCTRTS
2007
Springer
16 years 21 days ago
2007
Springer
Industry’s demand for flexible embedded solutions providing high performance and short time-to-market has led to the development of configurable and extensible processors. The...
167
click to vote
ICS
2005
Tsinghua U.
16 years 1 days ago
2005
Tsinghua U.
With the increasing performance gap between the processor and the memory, the importance of caches is increasing for high performance processors. However, with reducing feature si...