Sciweavers

2131 search results - page 72 / 427
» Immunity for Closed Sets
Sort
View
122
Voted
CVPR
2006
IEEE
16 years 2 months ago
Groupwise point pattern registration using a novel CDF-based Jensen-Shannon Divergence
In this paper, we propose a novel and robust algorithm for the groupwise non-rigid registration of multiple unlabeled point-sets with no bias toward any of the given pointsets. To...
Fei Wang, Baba C. Vemuri, Anand Rangarajan
100
Voted
SAS
2009
Springer
148views Formal Methods» more  SAS 2009»
16 years 1 months ago
Abstract Interpretation from a Topological Perspective
Interpretation from a Topological Perspective David A. Schmidt Kansas State University, Manhattan, Kansas, USA Abstract. Topology is the study of property sets (open sets) and cont...
David A. Schmidt
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
15 years 7 months ago
Computing Weakest Strategies for Safety Games of Imperfect Information
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
Wouter Kuijper, Jaco van de Pol
108
Voted
SDM
2008
SIAM
125views Data Mining» more  SDM 2008»
15 years 2 months ago
Mining and Ranking Generators of Sequential Patterns
Sequential pattern mining first proposed by Agrawal and Srikant has received intensive research due to its wide range applicability in many real-life domains. Various improvements...
David Lo, Siau-Cheng Khoo, Jinyan Li
125
Voted
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 3 months ago
Finding maximal k-edge-connected subgraphs from a large graph
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...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...