Sciweavers

7123 search results - page 402 / 1425
» The Ordered Set of Rough Sets
Sort
View
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
15 years 11 months ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta
188
Voted
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
15 years 11 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
184
Voted
MCU
1998
119views Hardware» more  MCU 1998»
15 years 8 months ago
DNA Computing Based on Splicing: Universality Results
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
Gheorghe Paun
205
Voted
GECCO
2008
Springer
163views Optimization» more  GECCO 2008»
15 years 8 months ago
Embedded evolutionary multi-objective optimization for worst case robustness
In Multi-Objective Problems (MOPs) involving uncertainty, each solution might be associated with a cluster of performances in the objective space depending on the possible scenari...
Gideon Avigad, Jürgen Branke
201
Voted
GECCO
2008
Springer
184views Optimization» more  GECCO 2008»
15 years 8 months ago
Analysis of mammography reports using maximum variation sampling
A genetic algorithm (GA) was developed to implement a maximum variation sampling technique to derive a subset of data from a large dataset of unstructured mammography reports. It ...
Robert M. Patton, Barbara G. Beckerman, Thomas E. ...