Sciweavers

6142 search results - page 12 / 1229
» The Complexity of Partition Functions
Sort
View
ECML
2006
Springer
13 years 11 months ago
Unsupervised Multiple-Instance Learning for Functional Profiling of Genomic Data
Multiple-instance learning (MIL) is a popular concept among the AI community to support supervised learning applications in situations where only incomplete knowledge is available....
Corneliu Henegar, Karine Clément, Jean-Dani...
EUC
2006
Springer
13 years 11 months ago
Custom Instruction Generation Using Temporal Partitioning Techniques for a Reconfigurable Functional Unit
Extracting appropriate custom instructions is an important phase for implementing an application on an extensible processor with a reconfigurable functional unit (RFU). Custom inst...
Farhad Mehdipour, Hamid Noori, Morteza Saheb Zaman...
ISCAS
2008
IEEE
106views Hardware» more  ISCAS 2008»
14 years 1 months ago
A quantitative evaluation of C-based synthesis on heterogeneous embedded systems design
C-based design techniques and methodologies have been proposed to tackle the complexity of heterogeneous embedded systems. The heterogeneity comes in the functionalities and the im...
Omar Hammami, Zoukun Wang, Virginie Fresse, Domini...
COMPLEXITY
2010
120views more  COMPLEXITY 2010»
13 years 4 months ago
The complexity of partition tasks
In this paper we introduce the Partition Task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system...
Fernando Eesponda, Matías Vera-Cruz, Jorge ...
COMBINATORICS
2002
86views more  COMBINATORICS 2002»
13 years 7 months ago
On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices
We present a new expression for the partition function of the dimer arrangements and the Ising partition function of the 3-dimensional cubic lattice. We use the Pfaffian method. T...
Martin Loebl