1998 search results - page 264 / 400 » Complexity of the Cover Polynomial |
107
Voted
TOCL
2011
14 years 7 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
110
Voted
INFOCOM
2011
IEEE
14 years 4 months ago
2011
IEEE
—We explore distributed mechanisms for maintaining the physical layer connectivity of a mobile wireless network while still permitting significant area coverage. Moreover, we re...
205
Voted
CCECE
2011
IEEE
14 years 23 days ago
2011
IEEE
— Although "Adaptive Mesh" is regarded as complicating method for object tracking accompanied with many controversies and obstacles, but it has been proposed that such ...
170
Voted
PAMI
2012
13 years 3 months ago
2012
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
174
click to vote
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
Saliency estimation has become a valuable tool in image processing. Yet, existing approaches exhibit considerable variation in methodology, and it is often difficult to attribute...