Sciweavers

1573 search results - page 169 / 315
» A Data Structure for Sponsored Search
Sort
View
IPPS
2007
IEEE
15 years 11 months ago
A Key-based Adaptive Transactional Memory Executor
Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operation...
Tongxin Bai, Xipeng Shen, Chengliang Zhang, Willia...
ESOP
2006
Springer
15 years 8 months ago
Pure Pattern Calculus
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
C. Barry Jay, Delia Kesner
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 5 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
FOCS
2000
IEEE
15 years 9 months ago
Cache-Oblivious B-Trees
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
Michael A. Bender, Erik D. Demaine, Martin Farach-...
DOCENG
2007
ACM
15 years 8 months ago
Adapting associative classification to text categorization
Associative classification, which originates from numerical data mining, has been applied to deal with text data recently. Text data is firstly digitalized to database of transact...
Baoli Li, Neha Sugandh, Ernest V. Garcia, Ashwin R...