Sciweavers

3220 search results - page 269 / 644
» Constrained Graph Processes
Sort
View
AVSS
2009
IEEE
15 years 4 months ago
Landmark Localisation in 3D Face Data
A comparison of several approaches that use graph matching and cascade filtering for landmark localisation in 3D face data is presented. For the first method, we apply the structur...
Marcelo Romero, Nick Pears
SMA
2008
ACM
172views Solid Modeling» more  SMA 2008»
15 years 6 months ago
Guarding curvilinear art galleries with edge or mobile guards
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
Menelaos I. Karavelas
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
16 years 7 months ago
Event detection from evolution of click-through data
Previous efforts on event detection from the web have focused primarily on web content and structure data ignoring the rich collection of web log data. In this paper, we propose t...
Qiankun Zhao, Tie-Yan Liu, Sourav S. Bhowmick, Wei...
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
15 years 10 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
KAIS
2011
129views more  KAIS 2011»
15 years 1 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis