6740 search results - page 1163 / 1348 » An s -Hamiltonian Line Graph Problem |
158
click to vote
ACL
2010
15 years 2 months ago
2010
Name ambiguity problem has raised urgent demands for efficient, high-quality named entity disambiguation methods. In recent years, the increasing availability of large-scale, rich...
182
click to vote
AMDO
2010
Springer
15 years 2 months ago
2010
Springer
Particle Filter methods are one of the dominant tracking paradigms due to its ability to handle non-gaussian processes, multimodality and temporal consistency. Traditionally, the e...
157
click to vote
IAT
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
181
click to vote
WINE
2010
Springer
15 years 2 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
167
click to vote
AAIM
2009
Springer
15 years 2 months ago
2009
Springer
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...