Sciweavers

9572 search results - page 7 / 1915
» Cover Algorithms and Their Combination
Sort
View
TOCL
2008
128views more  TOCL 2008»
14 years 11 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
CORR
2010
Springer
108views Education» more  CORR 2010»
14 years 11 months ago
Mining The Successful Binary Combinations: Methodology and A Simple Case Study
The importance of finding the characteristics leading to either a success or a failure is one of the driving forces of data mining. The various application areas of finding succes...
Yuval Cohen
GLVLSI
2007
IEEE
139views VLSI» more  GLVLSI 2007»
15 years 6 months ago
Synthesis of irregular combinational functions with large don't care sets
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
Valentin Gherman, Hans-Joachim Wunderlich, R. D. M...
IFIP
1999
Springer
15 years 3 months ago
Aura II: Combining Negative Thinking and Branch-and-Bound in Unate Covering Problems
Luca P. Carloni, Evguenii I. Goldberg, Tiziano Vil...
CGF
2007
156views more  CGF 2007»
14 years 11 months ago
QuadCover - Surface Parameterization using Branched Coverings
We introduce an algorithm for the automatic computation of global parameterizations on arbitrary simplicial 2manifolds, whose parameter lines are guided by a given frame field, f...
Felix Kälberer, Matthias Nieser, Konrad Polth...