Sciweavers

389 search results - page 42 / 78
» Some natural decision problems in automatic graphs
Sort
View
BMCBI
2008
149views more  BMCBI 2008»
13 years 7 months ago
All-paths graph kernel for protein-protein interaction extraction with evaluation of cross-corpus learning
Background: Automated extraction of protein-protein interactions (PPI) is an important and widely studied task in biomedical text mining. We propose a graph kernel based approach ...
Antti Airola, Sampo Pyysalo, Jari Björne, Tap...
ICCBR
2009
Springer
14 years 2 months ago
Case-Based Collective Inference for Maritime Object Classification
Maritime assets such as merchant and navy ships, ports, and harbors, are targets of terrorist attacks as evidenced by the USS Cole bombing. Conventional methods of securing maritim...
Kalyan Moy Gupta, David W. Aha, Philip Moore
ESOP
2010
Springer
14 years 4 months ago
Automating Security Mediation Placement
Abstract. We present a framework that automatically produces suggestions to resolve type errors in security-typed programs, enabling legacy code to be retrofit with comprehensive s...
Dave King 0002, Divya Muthukumaran, Sanjit A. Sesh...
CORR
2004
Springer
104views Education» more  CORR 2004»
13 years 7 months ago
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
David Jao, Stephen D. Miller, Ramarathnam Venkates...
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
14 years 27 days ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke