Sciweavers

12863 search results - page 626 / 2573
» Dynamic Data Mining
Sort
View
CACM
2000
147views more  CACM 2000»
15 years 7 months ago
Adaptive Web sites
Today's Web sites are intricate but not intelligent; while Web navigation is dynamic and idiosyncratic, all too often Web sites are fossils cast in HTML. In response, this pa...
Mike Perkowitz, Oren Etzioni
IEEEHPCS
2010
15 years 5 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...
ICDE
2000
IEEE
111views Database» more  ICDE 2000»
16 years 8 months ago
Dynamic Query Scheduling in Data Integration Systems
Execution plans produced by traditional query optimizers for data integration queries may yield poor performance for several reasons. The cost estimates may be inaccurate, the mem...
C. Mohan, Françoise Fabret, Luc Bouganim, P...
ITCC
2005
IEEE
16 years 21 days ago
The Grid-DBMS: Towards Dynamic Data Management in Grid Environments
Nowadays many data grid applications need to manage and process a huge amount of data distributed across multiple grid nodes and stored into heterogeneous databases. Grids encoura...
Giovanni Aloisio, Massimo Cafaro, Sandro Fiore, Ma...
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
15 years 6 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...