5473 search results - page 758 / 1095 » On the graph isomorphism problem |
160
Voted
ALGORITHMICA
2002
15 years 6 months ago
2002
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
163
click to vote
IVC
2000
15 years 6 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
242
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
224
click to vote
IEEESCC
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
204
click to vote
CVPR
2011
IEEE
15 years 3 months ago
2011
IEEE
Reconstructing transparent objects is a challenging problem. While producing reasonable results for quite complex objects, existing approaches require custom calibration or somewh...