Sciweavers

6142 search results - page 334 / 1229
» The Complexity of Partition Functions
Sort
View
EMNLP
2007
15 years 8 months ago
Structured Prediction Models via the Matrix-Tree Theorem
This paper provides an algorithmic framework for learning statistical models involving directed spanning trees, or equivalently non-projective dependency structures. We show how p...
Terry Koo, Amir Globerson, Xavier Carreras, Michae...
ISMB
1994
15 years 8 months ago
Neural Networks for Determining Protein Specificity and Multiple Alignment of Binding Sites
Weuse a quantitative definition of specificity to developa neural networkfor the identification of commonprotein binding sites in a collection of unaligned DNAfragments. Wedemonst...
John M. Heumann, Alan S. Lapedes, Gary D. Stormo
AUTOMATICA
2008
97views more  AUTOMATICA 2008»
15 years 6 months ago
Injectivity analysis using interval analysis: Application to structural identifiability
This paper presents a new numerical algorithm based on interval analysis able to prove that a differentiable function f : A Rn Rn is injective. This algorithm also performs a par...
Sebastien Lagrange, Nicolas Delanoue, Luc Jaulin
EOR
2010
219views more  EOR 2010»
15 years 6 months ago
The Attractive Traveling Salesman Problem
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
Günes Erdogan, Jean-François Cordeau, ...
ENTCS
2008
90views more  ENTCS 2008»
15 years 6 months ago
A Database Approach to Distributed State Space Generation
We study distributed state space generation on a cluster of workstations. It is explained why state space partitioning by a global hash function is problematic when states contain...
Stefan Blom, Bert Lisser, Jaco van de Pol, Michael...