Sciweavers

549 search results - page 94 / 110
» On the Complexity of Restricted k-anonymity Problem
Sort
View
MOC
1998
108views more  MOC 1998»
14 years 9 months ago
Numerical conformal mapping based on the generalised conjugation operator
Abstract. An iterative procedure for numerical conformal mapping is presented which imposes no restriction on the boundary complexity. The formulation involves two analytically equ...
Bao Cheng Li, Stavros Syngellakis
MOC
1998
92views more  MOC 1998»
14 years 9 months ago
Perturbing polynomials with all their roots on the unit circle
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
Michael J. Mossinghoff, Christopher G. Pinner, Jef...
ICRA
2010
IEEE
119views Robotics» more  ICRA 2010»
14 years 8 months ago
Evader surveillance under incomplete information
— This paper is concerned with determining whether a mobile robot, called the pursuer, is up to maintaining visibility of an antagonist agent, called the evader. This problem, a ...
Israel Becerra, Rafael Murrieta-Cid, Raul Monroy
ICIP
2010
IEEE
14 years 7 months ago
Non-rigid image registration by using graph-cuts with mutual information
Non-rigid image registration plays an important role in medical image analysis. Recently, Tang and Chung proposed to model the non-rigid medical image registration problem as an e...
Ronald W. K. So, Albert C. S. Chung
TABLEAUX
2005
Springer
15 years 3 months ago
A Tableau-Based Explainer for DL Subsumption
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
Thorsten Liebig, Michael Halfmann