1162 search results - page 141 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
ICDCS
2009
IEEE
14 years 5 months ago
2009
IEEE
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
On photo sharing websites like Flickr and Zooomr, users are offered the possibility to assign tags to their uploaded pictures. Using these tags to find interesting groups of sem...
ICIP
2007
IEEE
13 years 12 months ago
2007
IEEE
The search for alias-free sampling lattices for a given frequency support, in particular those lattices achieving minimum sampling densities, is a fundamental issue in various app...
CGF
2011
12 years 11 months ago
2011
We introduce a fully automatic algorithm which optimizes the high-level structure of a given quadrilateral mesh to achieve a coarser quadrangular base complex. Such a topological ...