Sciweavers

11214 search results - page 196 / 2243
» Just-in-time data structures
Sort
View
KDD
1997
ACM
208views Data Mining» more  KDD 1997»
14 years 2 months ago
Metarule-Guided Mining of Multi-Dimensional Association Rules Using Data Cubes
In this paper, we employ a novel approach to metarule-guided, multi-dimensional association rule mining which explores a data cube structure. We propose algorithms for metarule-gu...
Micheline Kamber, Jiawei Han, Jenny Chiang
EOR
2010
103views more  EOR 2010»
13 years 10 months ago
Exploiting special structure in semidefinite programming: A survey of theory and applications
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven...
Etienne de Klerk
P2P
2006
IEEE
229views Communications» more  P2P 2006»
14 years 4 months ago
Cost-Aware Processing of Similarity Queries in Structured Overlays
Large-scale distributed data management with P2P systems requires the existence of similarity operators for queries as we cannot assume that all users will agree on exactly the sa...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
EDBT
2004
ACM
313views Database» more  EDBT 2004»
14 years 11 months ago
XQzip: Querying Compressed XML Using Structural Indexing
XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many...
James Cheng, Wilfred Ng
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 9 months ago
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
Gerth Stølting Brodal, Erik D. Demaine, Jer...