Sciweavers

493 search results - page 74 / 99
» Alternating Weighted Automata
Sort
View
NETWORKS
2008
13 years 7 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
NAR
2000
121views more  NAR 2000»
13 years 7 months ago
The RESID Database of protein structure modifications: 2000 update
The RESID Database contains supplemental information on post-translational modifications for the standardized annotations appearing in the PIR-International Protein Sequence Datab...
John S. Garavelli
NN
2000
Springer
161views Neural Networks» more  NN 2000»
13 years 7 months ago
How good are support vector machines?
Support vector (SV) machines are useful tools to classify populations characterized by abrupt decreases in density functions. At least for one class of Gaussian data model the SV ...
Sarunas Raudys
ORL
2010
85views more  ORL 2010»
13 years 6 months ago
Stable routing under the Spanning Tree Protocol
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo,...
NAACL
2010
13 years 5 months ago
Investigations into the Crandem Approach to Word Recognition
We suggest improvements to a previously proposed framework for integrating Conditional Random Fields and Hidden Markov Models, dubbed a Crandem system (2009). The previous authors...
Rohit Prabhavalkar, Preethi Jyothi, William Hartma...