Sciweavers

872 search results - page 36 / 175
» Real world performance of association rule algorithms
Sort
View
ANCS
2009
ACM
14 years 7 months ago
Progressive hashing for packet processing using set associative memory
As the Internet grows, both the number of rules in packet filtering databases and the number of prefixes in IP lookup tables inside the router are growing. The packet processing e...
Michel Hanna, Socrates Demetriades, Sangyeun Cho, ...
RSS
2007
119views Robotics» more  RSS 2007»
14 years 11 months ago
BS-SLAM: Shaping the World
— This paper presents BS-SLAM, a simultaneous localization and mapping algorithm for use in unstructured environments that is effective regardless of whether features correspond ...
Luis Pedraza, Gamini Dissanayake, Jaime Valls Mir&...
MM
2005
ACM
243views Multimedia» more  MM 2005»
15 years 3 months ago
Image region entropy: a measure of "visualness" of web images associated with one concept
We propose a new method to measure “visualness” of concepts, that is, what extent concepts have visual characteristics. To know which concept has visually discriminative power...
Keiji Yanai, Kobus Barnard
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
15 years 10 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
ER
2001
Springer
130views Database» more  ER 2001»
15 years 2 months ago
NF-SS: A Normal Form for Semistructured Schema
Semistructured data is becoming increasingly important for web applications with the development of XML and related technologies. Designing a “good” semistructured database is ...
Xiaoying Wu, Tok Wang Ling, Sin Yeung Lee, Mong-Li...