1508 search results - page 75 / 302 » Efficient Path Profiling |
96
Voted
CEC
2005
IEEE
15 years 4 months ago
2005
IEEE
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...
133
Voted
CATA
2004
15 years 4 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
113
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
93
Voted
IJBIDM
2006
15 years 2 months ago
2006
: Workflow Management Systems (WfMS) provide a fundamental technological infrastructure to define and manage business processes efficiently. WfMS logs contain valuable data that ca...
121
click to vote
JMLR
2010
14 years 9 months ago
2010
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...