1629 search results - page 189 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
RAS
2002
14 years 9 months ago
2002
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
108
click to vote
MIR
2010
ACM
15 years 2 months ago
2010
ACM
Mobile devices are increasingly powerful in media storage and rendering. The prevalent request of decent video browsing on mobile devices is demanding. However, one limitation com...
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents an efficient method to integrate various spatial-temporal constraints to regularize the contour tracking. The global shape of the contour is represented in a p...
ADMA
2006
Springer
15 years 4 months ago
2006
Springer
Gene Expression Programming (GEP) aims at discovering essential rules hidden in observed data and expressing them mathematically. GEP has been proved to be a powerful tool for cons...