729 search results - page 70 / 146 » Solving subgraph isomorphism problems with constraint progra... |
152
click to vote
MOZ
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...
138
Voted
JMLR
2006
15 years 3 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
170
Voted
SOCC
2008
IEEE
15 years 10 months ago
2008
IEEE
— Scaling down the voltage levels of the processing elements (PEs) in a Network-on-Chip (NoC) can significantly reduce the computation energy consumption with an overhead of the...
133
Voted
FUIN
2010
15 years 2 months ago
2010
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
131
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...