Sciweavers

2695 search results - page 96 / 539
» Learning Graph Matching
Sort
View
AAAI
2006
15 years 3 months ago
Learning Blocking Schemes for Record Linkage
Record linkage is the process of matching records across data sets that refer to the same entity. One issue within record linkage is determining which record pairs to consider, si...
Matthew Michelson, Craig A. Knoblock
JUCS
2008
147views more  JUCS 2008»
15 years 2 months ago
Authoring Courses with Rich Adaptive Sequencing for IMS Learning Design
: This paper describes the process of translating an adaptive sequencing strategy designed using Sequencing Graphs to the semantics of IMS Learning Design. The relevance of this co...
Sergio Gutiérrez Santos, Abelardo Pardo, Ca...
SDM
2009
SIAM
113views Data Mining» more  SDM 2009»
15 years 11 months ago
Graph Generation with Prescribed Feature Constraints.
In this paper, we study the problem of how to generate synthetic graphs matching various properties of a real social network with two applications, privacy preserving social netwo...
Xiaowei Ying, Xintao Wu
JGT
2006
60views more  JGT 2006»
15 years 2 months ago
Spanning subgraphs of graphs partitioned into two isomorphic pieces
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
Anthony Bonato
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
14 years 12 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...