Sciweavers

1154 search results - page 147 / 231
» On the editing distance of graphs
Sort
View
TKDE
2011
362views more  TKDE 2011»
15 years 1 months ago
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
Luh Yen, Marco Saerens, François Fouss
PVLDB
2010
85views more  PVLDB 2010»
15 years 5 months ago
Evaluating Entity Resolution Results
Entity Resolution (ER) is the process of identifying groups of records that refer to the same real-world entity. Various measures (e.g., pairwise F1, cluster F1) have been used fo...
David Menestrina, Steven Whang, Hector Garcia-Moli...
CORR
2010
Springer
164views Education» more  CORR 2010»
15 years 5 months ago
Securing AODV for MANETs using Message Digest with Secret Key
Due to lack of the infrastructure, open peer-to-peer architecture, shared wireless medium, limited resource constraints and highly dynamic topology, MANETs (Mobile Adhoc Networks) ...
Kamaljit I. Lakhtaria, Bhaskar N. Patel, Satish G....
ICIP
2006
IEEE
16 years 8 months ago
Virtual Craniofacial Reconstruction from Computed Tomography Image Sequences Exhibiting Multiple Fractures
A novel procedure for in-silico (virtual) craniofacial reconstruction of human mandibles with multiple fractures from a sequence of Computed Tomography (CT) images is presented. T...
Ananda S. Chowdhury, Suchendra M. Bhandarkar, Robe...
162
Voted
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
16 years 8 days ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki