1503 search results - page 176 / 301 » Detecting Anomalies in Graphs |
154
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
146
click to vote
ICTAI
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial con...
205
click to vote
CG
2004
Springer
15 years 6 months ago
2004
Springer
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...
163
click to vote
WABI
2007
Springer
16 years 17 days ago
2007
Springer
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
152
click to vote
SAC
2006
ACM
16 years 13 days ago
2006
ACM
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones i...