Sciweavers

2498 search results - page 452 / 500
» Data Structures with Unpredictable Timing
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 2 months ago
Mining frequent item sets by opportunistic projection
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 ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
16 years 2 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
15 years 9 months ago
Primal sparse Max-margin Markov networks
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
Jun Zhu, Eric P. Xing, Bo Zhang
MICRO
2009
IEEE
148views Hardware» more  MICRO 2009»
15 years 9 months ago
Flip-N-Write: a simple deterministic technique to improve PRAM write performance, energy and endurance
The phase-change random access memory (PRAM) technology is fast maturing to production levels. Main advantages of PRAM are non-volatility, byte addressability, in-place programmab...
Sangyeun Cho, Hyunjin Lee
CIKM
2009
Springer
15 years 9 months ago
Semi-supervised learning of semantic classes for query understanding: from the web and for the web
Understanding intents from search queries can improve a user’s search experience and boost a site’s advertising profits. Query tagging via statistical sequential labeling mode...
Ye-Yi Wang, Raphael Hoffmann, Xiao Li, Jakub Szyma...