Sciweavers

1422 search results - page 71 / 285
» Complementation in Abstract Interpretation
Sort
View
120
Voted
CP
2006
Springer
15 years 8 months ago
Propagation in CSP and SAT
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
Yannis Dimopoulos, Kostas Stergiou
JDA
2006
98views more  JDA 2006»
15 years 4 months ago
Completely connected clustered graphs
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
Sabine Cornelsen, Dorothea Wagner
145
Voted
DLT
2009
15 years 2 months ago
Tight Bounds on the Descriptional Complexity of Regular Expressions
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
Hermann Gruber, Markus Holzer
EDM
2009
105views Data Mining» more  EDM 2009»
15 years 2 months ago
Subspace Clustering of Skill Mastery: Identifying Skills that Separate Students
Abstract. In educational research, a fundamental goal is identifying which skills students have mastered, which skills they have not, and which skills they are in the process of ma...
Rebecca Nugent, Elizabeth Ayers, Nema Dean
104
Voted
ICASSP
2011
IEEE
14 years 8 months ago
A novel fast canonical-signed-digit conversion technique for multiplication
Abstract—Fast multiplication can be achieved by using canonical signed digit (CSD) to speed-up computations. Conversion to CSD is needed when the multiplier is not known a priori...
Rui Guo, Linda DeBrunner