Sciweavers

1857 search results - page 241 / 372
» Minimum Degree Orderings
Sort
View
DAWAK
2006
Springer
15 years 10 months ago
Two New Techniques for Hiding Sensitive Itemsets and Their Empirical Evaluation
Many privacy preserving data mining algorithms attempt to selectively hide what database owners consider as sensitive. Specifically, in the association-rules domain, many of these ...
Ahmed HajYasien, Vladimir Estivill-Castro
FCCM
2006
IEEE
170views VLSI» more  FCCM 2006»
15 years 10 months ago
An Architecture for Efficient Hardware Data Mining using Reconfigurable Computing Systems
The Apriori algorithm is a fundamental correlation-based data mining kernel used in a variety of fields. The innovation in this paper is a highly parallel custom architecture impl...
Zachary K. Baker, Viktor K. Prasanna
FORMATS
2006
Springer
15 years 10 months ago
On the Computational Power of Timed Differentiable Petri Nets
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...
Serge Haddad, Laura Recalde, Manuel Silva
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
15 years 10 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner
AAAI
2007
15 years 8 months ago
Near-optimal Observation Selection using Submodular Functions
AI problems such as autonomous robotic exploration, automatic diagnosis and activity recognition have in common the need for choosing among a set of informative but possibly expen...
Andreas Krause, Carlos Guestrin