In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Using a saliency measure based on the global property of contour closure, we have developed a method that reliably segments out salient contours bounding unknown objects from real...
Shyjan Mahamud, Karvel K. Thornber, Lance R. Willi...
Abstract. With the emergence of Web service technologies, it has become possible to use high level megaprogramming models and visual tools to easily build distributed systems using...
Abstract. Orange (www.ailab.si/orange) is a suite for machine learning and data mining. It can be used though scripting in Python or with visual programming in Orange Canvas using ...
Janez Demsar, Blaz Zupan, Gregor Leban, Tomaz Curk
In this paper we propose an automatic mechanism for annotating XML documents. This mechanism relies on a simple data model whose main features are: (1) a modeling of XML documents ...