Sciweavers

6740 search results - page 155 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
CVPR
2011
IEEE
13 years 2 months ago
Reconstruction of relief objects from line drawings
This paper addresses the problem of automatic reconstruction of a 3D relief from a line drawing on top of a given base object. Reconstruction is challenging due to four reasons â€...
Michael Kolomenkin, George Leifman, Ilan Shimshoni...
CVPR
2011
IEEE
13 years 2 months ago
Max-margin Clustering: Detecting Margins from Projections of Points on Lines
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
Raghuraman Gopalan, Jagan Sankaranarayanan
ADC
2008
Springer
110views Database» more  ADC 2008»
14 years 4 months ago
Graph Mining based on a Data Partitioning Approach
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
Son N. Nguyen, Maria E. Orlowska, Xue Li
PVLDB
2010
200views more  PVLDB 2010»
13 years 8 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
ICSM
2003
IEEE
14 years 3 months ago
On Modeling Software Architecture Recovery as Graph Matching
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both ...
Kamran Sartipi, Kostas Kontogiannis