6740 search results - page 194 / 1348 » An s -Hamiltonian Line Graph Problem |
DAM
2008
13 years 10 months ago
2008
For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition nu...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...
ICCV
2005
IEEE
15 years 17 days ago
2005
IEEE
Object tracking is a challenging problems in real-time computer vision due to variations of lighting condition, pose, scale, and view-point over time. However, it is exceptionally...
GIS
2009
ACM
14 years 11 months ago
2009
ACM
With the recent advancements and wide usage of location detection devices, large quantities of data are collected by GPS and cellular technologies in the form of trajectories. Whi...
ICML
2003
IEEE
14 years 11 months ago
2003
IEEE
The majority of theoretical work in machine learning is done under the assumption of exchangeability: essentially, it is assumed that the examples are generated from the same prob...