3208 search results - page 279 / 642 » A Lower Bound for Primality |
193
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
202
click to vote
TON
2012
13 years 9 months ago
2012
—In this paper we investigate the static multicast advance reservation (MCAR) problem for all-optical wavelengthrouted WDM networks. Under the advanced reservation traffic model...
196
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Stereo visual odometry and dense scene reconstruction depend critically on accurate calibration of the extrinsic (relative) stereo camera poses. We present an algorithm for contin...
169
click to vote
AAAI
2012
2012
Automatic Targetless Extrinsic Calibration of a 3D Lidar and Camera by Maximizing Mutual Information
13 years 9 months ago
This paper reports on a mutual information (MI) based algorithm for automatic extrinsic calibration of a 3D laser scanner and optical camera system. By using MI as the registratio...
167
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...