2796 search results - page 501 / 560 » The coolest path problem |
IJCAI
2007
15 years 3 months ago
2007
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...
116
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
127
click to vote
COMCOM
2008
15 years 2 months ago
2008
In this paper, we study using game theory the problem of detecting intrusions in wired infrastructure networks. Detection is accomplished by sampling a subset of the transmitted p...
124
click to vote
BMCBI
2005
15 years 1 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
126
click to vote
TOC
2008
15 years 1 months ago
2008
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...