3715 search results - page 653 / 743 » A Space Optimization for FP-Growth |
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...
SC
2009
ACM
14 years 2 months ago
2009
ACM
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
SC
2009
ACM
14 years 2 months ago
2009
ACM
Scientific workflow tools allow users to specify complex computational experiments and provide a good framework for robust science and engineering. Workflows consist of pipelines ...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Coverage is a fundamental problem in Wireless Sensor Networks (WSNs). Existing studies on this topic focus on 2D ideal plane coverage and 3D full space coverage. In many real wo...
IRI
2009
IEEE
14 years 2 months ago
2009
IEEE
A 4KB page size has been used for Virtual Memory since the sixties. In fact, today, the most common page size is still 4KB. Choosing a page size is finding the middle ground betwe...