Sciweavers

11160 search results - page 42 / 2232
» Incompleteness in a General Setting
Sort
View
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
14 years 3 months ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
André Berger, Ojas Parekh
COMPGEOM
2001
ACM
14 years 1 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
IJCNN
2006
IEEE
14 years 3 months ago
Generalizing Independent Component Analysis for Two Related Data Sets
— We introduce in this paper methods for finding mutually corresponding dependent components from two different but related data sets in an unsupervised (blind) manner. The basi...
Juha Karhunen, Tomas Ukkonen
IPMI
2005
Springer
14 years 3 months ago
A Generalized Level Set Formulation of the Mumford-Shah Functional for Brain MR Image Segmentation
Brain MR image segmentation is an important research topic in medical image analysis area. In this paper, we propose an active contour model for brain MR image segmentation, based ...
Lishui Cheng, Jie Yang, Xian Fan, Yuemin Zhu
ENDM
2008
93views more  ENDM 2008»
13 years 10 months ago
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...