Sciweavers

112 search results - page 21 / 23
» Labeled Traveling Salesman Problems: Complexity and approxim...
Sort
View
ECCV
2008
Springer
14 years 9 months ago
GeoS: Geodesic Image Segmentation
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
Antonio Criminisi, Toby Sharp, Andrew Blake
STACS
2004
Springer
14 years 25 days ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
ENGL
2007
148views more  ENGL 2007»
13 years 7 months ago
A General Reflex Fuzzy Min-Max Neural Network
—“A General Reflex Fuzzy Min-Max Neural Network” (GRFMN) is presented. GRFMN is capable to extract the underlying structure of the data by means of supervised, unsupervised a...
Abhijeet V. Nandedkar, Prabir Kumar Biswas
PODS
2010
ACM
213views Database» more  PODS 2010»
14 years 17 days ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
CN
2006
75views more  CN 2006»
13 years 7 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon