1629 search results - page 185 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
62
Voted
GIS
2010
ACM
14 years 8 months ago
2010
ACM
We consider the problem of automatically cleaning massive sonar data point clouds, that is, the problem of automatically removing noisy points that for example appear as a result ...
72
Voted
CORR
2008
Springer
14 years 10 months ago
2008
Springer
In this paper, we consider a cognitive radio (CR) network in which the unlicensed (secondary) users are allowed to concurrently access the spectrum allocated to the licensed (prim...
JSAC
2008
14 years 10 months ago
2008
Abstract--Distributed and efficient resource allocation is critical for fully realizing the benefits of cooperative communications in large scale communication networks. This paper...
TCAD
2002
14 years 9 months ago
2002
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
100
click to vote
PAMI
2007
14 years 9 months ago
2007
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...