Sciweavers

5019 search results - page 10 / 1004
» Computing in Quotient Groups
Sort
View
SDM
2009
SIAM
205views Data Mining» more  SDM 2009»
15 years 9 months ago
Identifying Information-Rich Subspace Trends in High-Dimensional Data.
Identifying information-rich subsets in high-dimensional spaces and representing them as order revealing patterns (or trends) is an important and challenging research problem in m...
Chandan K. Reddy, Snehal Pokharkar
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
16 years 9 days ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
139
Voted
JDCTA
2010
228views more  JDCTA 2010»
14 years 6 months ago
Research and Progress of Cluster Algorithms based on Granular Computing
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Shifei Ding, Li Xu, Hong Zhu, Liwen Zhang
MMB
2010
Springer
185views Communications» more  MMB 2010»
15 years 1 months ago
Correctness Issues of Symbolic Bisimulation Computation for Markov Chains
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
Ralf Wimmer, Bernd Becker
APAL
2008
93views more  APAL 2008»
14 years 12 months ago
Arithmetic of Dedekind cuts of ordered Abelian groups
We study Dedekind cuts on ordered Abelian groups. We introduce a monoid structure on them, and we characterise, via a suitable representation theorem, the universal part of the th...
Antongiulio Fornasiero, Marcello Mamino