Sciweavers

9405 search results - page 38 / 1881
» Computing a Model of Set Theory
Sort
View
148
Voted
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 3 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
118
Voted
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 4 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
138
Voted
IJBC
2008
112views more  IJBC 2008»
15 years 2 months ago
Computation and Visualization of bifurcation Surfaces
The localization of critical parameter sets called bifurcations is often a central task of the analysis of a nonlinear dynamical system. Bifurcations of codimension 1 that can be ...
Dirk Stiefs, Thilo Gross, Ralf Steuer, Ulrike Feud...
141
Voted
VSTTE
2012
Springer
13 years 10 months ago
Deciding Functional Lists with Sublist Sets
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
Thomas Wies, Marco Muñiz, Viktor Kuncak
166
Voted
ISCI
2008
181views more  ISCI 2008»
15 years 2 months ago
Attribute reduction in decision-theoretic rough set models
Rough set theory can be applied to rule induction. There are two different types of classification rules, positive and boundary rules, leading to different decisions and consequen...
Yiyu Yao, Yan Zhao