Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
29
click to vote
PC
2002
favorite
Email
discuss
report
160
views
Management
»
more
PC 2002
»
Parallel frequent set counting
13 years 5 months ago
Download
www.dsi.unive.it
David B. Skillicorn
Real-time Traffic
Management
|
PC 2002
|
claim paper
Related Content
»
CoTS A Scalable Framework for Parallelizing Frequency Counting over Data Streams
»
A parallel distributed algorithm for relational frequent pattern discovery from very large...
»
Computing Frequent Itemsets Inside Oracle 10G
»
Discovering Frequent Itemsets in the Presence of Highly Frequent Items
»
kDCI a MultiStrategy Algorithm for Mining Frequent Sets
»
CTITL Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Grow...
»
Efficient Approximate Mining of Frequent Patterns over Transactional Data Streams
»
Mining Frequent Itemsets Using ReUsable Data Structure
»
Finding Recently Frequent Items in Distributed Data Streams
more »
Post Info
More Details (n/a)
Added
23 Dec 2010
Updated
23 Dec 2010
Type
Journal
Year
2002
Where
PC
Authors
David B. Skillicorn
Comments
(0)
Researcher Info
Management Study Group
Computer Vision