Sciweavers

5 search results - page 1 / 1
» The full binary tree cannot be interpreted in a chain
Sort
View
INTEGRATION
2002
57views more  INTEGRATION 2002»
13 years 4 months ago
To Booth or not to Booth
Booth Recoding is a commonly used technique to recode one of the operands in binary multiplication. In this way the implementation of a multipliers' adder tree can be improve...
Wolfgang J. Paul, Peter-Michael Seidel
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
13 years 7 months ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
CADE
2000
Springer
13 years 8 months ago
Reasoning with Individuals for the Description Logic SHIQ
Abstract. While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. I...
Ian Horrocks, Ulrike Sattler, Stephan Tobies
ICDT
2010
ACM
141views Database» more  ICDT 2010»
13 years 8 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller