Sciweavers

654 search results - page 75 / 131
» On the Approximation of Computing Evolutionary Trees
Sort
View
WG
2007
Springer
15 years 3 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
ICPR
2006
IEEE
15 years 11 months ago
A Higher-Order Active Contour Model for Tree Detection
We present a model of a `gas of circles', the ensemble of regions in the image domain consisting of an unknown number of circles with approximately fixed radius and short ran...
Peter Horvath, Ian Jermyn, Zoltan Kato, and Josian...
ICPR
2004
IEEE
15 years 11 months ago
Detection of Artificial Structures in Natural-Scene Images Using Dynamic Trees
We seek a framework that addresses localization, detection and recognition of man-made objects in natural-scene images in a unified manner. We propose to model artificial structur...
Michael C. Nechyba, Sinisa Todorovic
FOCS
2005
IEEE
15 years 3 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
NETWORKING
2011
14 years 19 days ago
Modelling and Evaluation of CCN-Caching Trees
Networking Named Content (NNC) was recently proposed as a new networking paradigm to realise Content Centric Networks (CCNs). The new paradigm changes much about the current Intern...
Ioannis Psaras, Richard G. Clegg, Raul Landa, Wei ...