3715 search results - page 417 / 743 » A Space Optimization for FP-Growth |
199
click to vote
INFORMS
1998
15 years 6 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
184
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
211
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper develops simple cost models for provisioning content distribution networks that use the simple and highly scalable bandwidth skimming protocol for streaming. New insight...
183
click to vote
SIGMOD
1999
ACM
15 years 11 months ago
1999
ACM
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
210
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...