447 search results - page 77 / 90 » Approximation Algorithms for Directed Steiner Problems |
GECCO
2010
Springer
15 years 3 months ago
2010
Springer
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...
SIGMOD
1998
ACM
15 years 4 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
111
click to vote
ICDM
2010
IEEE
14 years 9 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
MOC
2000
14 years 11 months ago
2000
Let {Sm} be an infinite sequence whose limit or antilimit S can be approximated very efficiently by applying a suitable extrapolation method E0 to {Sm}. Assume that the Sm and henc...
122
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...