Sciweavers

513 search results - page 69 / 103
» Efficient search for association rules
Sort
View
BDA
2004
14 years 11 months ago
Indexing XML Objects with Ordered Schema Trees
: XML DBMSs require new indexing techniques to efficiently process structural search and full-text search as integrated in XQuery. Much research has been done for indexing XML docu...
Laurent Yeh, Georges Gardarin
ASPDAC
2008
ACM
108views Hardware» more  ASPDAC 2008»
14 years 11 months ago
Synthesis and design of parameter extractors for low-power pre-computation-based content-addressable memory using gate-block sel
Content addressable memory (CAM) is frequently used in applications, such as lookup tables, databases, associative computing, and networking, that require high-speed searches due t...
Jui-Yuan Hsieh, Shanq-Jang Ruan
ENTCS
2002
128views more  ENTCS 2002»
14 years 9 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
RECSYS
2009
ACM
15 years 4 months ago
Latent dirichlet allocation for tag recommendation
Tagging systems have become major infrastructures on the Web. They allow users to create tags that annotate and categorize content and share them with other users, very helpful in...
Ralf Krestel, Peter Fankhauser, Wolfgang Nejdl
APWEB
2005
Springer
15 years 3 months ago
A Fast Algorithm for Mining Share-Frequent Itemsets
Itemset share has been proposed as a measure of the importance of itemsets for mining association rules. The value of the itemset share can provide useful information such as total...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang