Sciweavers

6142 search results - page 411 / 1229
» The Complexity of Partition Functions
Sort
View
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
15 years 4 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
ICIP
2009
IEEE
15 years 4 months ago
Genetic algorithms for 3d reconstruction with supershapes
Supershape model is a recent primitive that represents numerous 3D shapes with several symmetry axes. The main interest of this model is its capability to reconstruct more complex...
Sophie Voisin, Mongi A. Abidi, Sebti Foufou, Fr&ea...
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
16 years 25 days ago
Adaptive Blocking: Learning to Scale Up Record Linkage
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
Mikhail Bilenko, Beena Kamath, Raymond J. Mooney
ICPP
2002
IEEE
15 years 11 months ago
BPA: A Fast Packet Scheduling Algorithm for Real-Time Switched Ethernet Networks
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-...
Jinggang Wang, Binoy Ravindran
IJCAI
1997
15 years 8 months ago
Extracting Propositions from Trained Neural Networks
This paper presents an algorithm for extract­ ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
Hiroshi Tsukimoto