Sciweavers

4488 search results - page 88 / 898
» Properties of NP-Complete Sets
Sort
View
CAV
2006
Springer
141views Hardware» more  CAV 2006»
13 years 11 months ago
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
Robert Colvin, Lindsay Groves, Victor Luchangco, M...
EUROISI
2008
13 years 9 months ago
An Information Theory Approach to Identify Sets of Key Players
This paper presents an application of information theory to identify sets of key players in social networks. First, we define two entropy measures that we use to analyze the struct...
Daniel Ortiz Arroyo, Dil Muhammad Akbar Hussain
SDM
2004
SIAM
224views Data Mining» more  SDM 2004»
13 years 9 months ago
Hierarchical Clustering for Thematic Browsing and Summarization of Large Sets of Association Rules
In this paper we propose a method for grouping and summarizing large sets of association rules according to the items contained in each rule. We use hierarchical clustering to par...
Alípio Jorge
DAGSTUHL
1997
13 years 9 months ago
InVIS - Interactive Visualization of Medical Data Sets
Interactive rendering of large data sets requires fast algorithms and rapid hardware acceleration. Both can be improved, but none of this ensures interactive response times. If a ...
Jörg Meyer, Steffen Gelder, Timna E. Schneide...
EJC
2008
13 years 8 months ago
Pattern classes of permutations via bijections between linearly ordered sets
Abstract. A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which...
Sophie Huczynska, Nikola Ruskuc