Sciweavers

2064 search results - page 394 / 413
» A Comparative Study of Fuzzy Sets and Rough Sets
Sort
View
SPAA
1997
ACM
15 years 4 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
DEBS
2007
ACM
15 years 3 months ago
Scalable event matching for overlapping subscriptions in pub/sub systems
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
COCO
2010
Springer
129views Algorithms» more  COCO 2010»
15 years 3 months ago
On the Relative Strength of Pebbling and Resolution
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Jakob Nordström
FOCS
2004
IEEE
15 years 3 months ago
On the Streaming Model Augmented with a Sorting Primitive
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, ...
DIS
2006
Springer
15 years 3 months ago
Visual Interactive Subgroup Discovery with Numerical Properties of Interest
Abstract. We propose an approach to subgroup discovery using distribution rules (a kind of association rules with a probability distribution on the consequent) for numerical proper...
Alípio Mário Jorge, Fernando Pereira...