96 search results - page 11 / 20 » Large Quasi-Tree Drawing: A Neighborhood Based Approach |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
Automatically assessing photo quality from the perspective of visual aesthetics is of great interest in high-level vision research and has drawn much attention in recent years. In...
CIVR
2007
Springer
14 years 1 months ago
2007
Springer
Large archives of Ottoman documents are challenging to many historians all over the world. However, these archives remain inaccessible since manual transcription of such a huge vo...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
The aim of this work is to propose an adaptation of optimal path based interactive tools for image segmentation (related to Live-Wire [12] and Intelligent Scissors [18] approaches)...
DEXA
1995
Springer
13 years 11 months ago
1995
Springer
To support applications, such as efficient browsing in large knowledge bases and cooperative knowledge discovery in large databases, the concept of rule similarity is essential. In...