1594 search results - page 177 / 319 » An Algorithm to Compute Collusion Paths |
123
Voted
WG
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
134
click to vote
STACS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
123
Voted
EMNLP
2008
15 years 5 months ago
2008
This paper introduces a new kernel which computes similarity between two natural language sentences as the number of paths shared by their dependency trees. The paper gives a very...
115
click to vote
IPL
2010
15 years 2 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
113
click to vote
GI
2009
Springer
15 years 1 months ago
2009
Springer
: An operational Air Surveillance System shall generate a stable and reliable air picture. In dense target situations the quality of available sensor data is reduced. System models...