6582 search results - page 99 / 1317 » The focus of attention problem |
174
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
165
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
-fields are a very general class of difference fields that enable one to discover and prove multisum identities arising in combinatorics and special functions. In this article we f...
186
click to vote
ECCV
2000
Springer
16 years 8 months ago
2000
Springer
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
163
click to vote
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
208
click to vote
IWCMC
2010
ACM
15 years 11 months ago
2010
ACM
Wireless ad hoc networks consist of hundreds to thousands of mobile nodes that are powered by batteries. To prolong the network operational time, energy conservation in such netwo...