794 search results - page 30 / 159 » Improved algorithms for orienteering and related problems |
STOC
2010
ACM
14 years 3 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
CIMAGING
2009
13 years 11 months ago
2009
We present a new method for multi-object segmentation in a maximum a posteriori estimation framework. Our method is motivated by the observation that neighboring or coupling objec...
OHS
2001
Springer
14 years 2 months ago
2001
Springer
The size of Internet has been growing very fast and many documents appear every day in the Net. Users find many problems to obtain the information that they really need. In order t...
DKE
2007
13 years 10 months ago
2007
Finding interaction patterns is a challenging problem, but this kind of information about processes or social networks might be useful for an organization’s management to unders...
ISSAC
2007
Springer
14 years 4 months ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...