Sciweavers

262 search results - page 17 / 53
» Conformal Mapping in Linear Time
Sort
View
POPL
1996
ACM
13 years 11 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
IVC
2000
179views more  IVC 2000»
13 years 7 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
14 years 1 months ago
Isolation Forest
Most existing model-based approaches to anomaly detection construct a profile of normal instances, then identify instances that do not conform to the normal profile as anomalies...
Fei Tony Liu, Kai Ming Ting, Zhi-Hua Zhou
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
14 years 21 days ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
CVPR
2004
IEEE
14 years 9 months ago
Optimizing Motion Estimation with Linear Programming and Detail-Preserving Variational Method
In this paper, we propose a novel linear programming based method to estimate arbitrary motion from two images. The proposed method always finds the global optimal solution of the...
Hao Jiang, Ze-Nian Li, Mark S. Drew