Sciweavers

114 search results - page 10 / 23
» Some Notes on Pseudo-closed Sets
Sort
View
UC
2009
Springer
14 years 2 months ago
Computing Domains of Attraction for Planar Dynamics
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
Daniel S. Graça, Ning Zhong
ICDE
2010
IEEE
238views Database» more  ICDE 2010»
14 years 2 months ago
Correlation hiding by independence masking
— Extracting useful correlation from a dataset has been extensively studied. In this paper, we deal with the opposite, namely, a problem we call correlation hiding (CH), which is...
Yufei Tao, Jian Pei, Jiexing Li, Xiaokui Xiao, Ke ...
EDBT
2009
ACM
172views Database» more  EDBT 2009»
14 years 5 days ago
Continuous visible nearest neighbor queries
In this paper, we identify and solve a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search. Given a data set P, an obstacle set O, and a query li...
Yunjun Gao, Baihua Zheng, Wang-Chien Lee, Gencai C...
DMGT
2011
94views more  DMGT 2011»
12 years 11 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...
JMIV
2007
156views more  JMIV 2007»
13 years 7 months ago
Using the Shape Gradient for Active Contour Segmentation: from the Continuous to the Discrete Formulation
A variational approach to image or video segmentation consists in defining an energy depending on local or global image characteristics, the minimum of which being reached for ob...
Eric Debreuve, Muriel Gastaud, Michel Barlaud, Gil...