2796 search results - page 453 / 560 » The coolest path problem |
183
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We propose a novel semi-supervised classifier for handwritten digit recognition problems that is based on the assumption that any digit can be obtained as a slight transformation...
168
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
164
Voted
IPCO
2007
15 years 7 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
156
click to vote
SODA
1990
ACM
15 years 7 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
152
click to vote
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...