Sciweavers

9719 search results - page 209 / 1944
» Answer Set Optimization
Sort
View
CCCG
2010
15 years 8 months ago
Connected dominating sets on dynamic geometric graphs
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
Leonidas J. Guibas, Nikola Milosavljevic, Arik Mot...
HAIS
2008
Springer
15 years 7 months ago
Extracting Multi-knowledge from fMRI Data through Swarm-Based Rough Set Reduction
Abstract. Functional Magnetic Resonance Imaging (fMRI) data is collected ceaselessly during brain research, which implicates some important information. It need to be extracted and...
Hongbo Liu, Ajith Abraham, Hong Ye
JUCS
2006
87views more  JUCS 2006»
15 years 6 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
CORR
2002
Springer
144views Education» more  CORR 2002»
15 years 6 months ago
Polynomial Time Data Reduction for Dominating Set
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
Jochen Alber, Michael R. Fellows, Rolf Niedermeier
PRL
2007
158views more  PRL 2007»
15 years 6 months ago
Stability and convergence of the level set method in computer vision
Several computer vision problems, like segmentation, tracking and shape modeling, are increasingly being solved using level set methodologies. But the critical issues of stability...
Kunal N. Chaudhury, K. R. Ramakrishnan