2446 search results - page 182 / 490 » Choiceless Polynomial Time |
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—Most research works in routing and design of optical networks assume that the optical medium can carry signals without any bit error. However, the physical impairments on the op...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents a novel graph cut based segmentation approach with shape priors. The model incorporates statistical shape prior information with the active contour without edg...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
PIMRC
2008
IEEE
14 years 2 months ago
2008
IEEE
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...