Sciweavers

1056 search results - page 102 / 212
» Constraint-Based Graph Matching
Sort
View
ICSM
2007
IEEE
14 years 3 months ago
Matching Control Flow of Program Versions
In many application areas, including piracy detection, software debugging and maintenance, situations arise in which there is a need for comparing two versions of a program that d...
Vijayanand Nagarajan, Rajiv Gupta, Matias Madou, X...
ICALP
2005
Springer
14 years 2 months ago
Approximation Algorithms for the Max-coloring Problem
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Sriram V. Pemmaraju, Rajiv Raman
ICPR
2006
IEEE
14 years 10 months ago
A Non-Iterative Approach to Reconstruct Face Templates from Match Scores
Regeneration of biometric templates from match scores has security and privacy implications related to any biometric based authentication system. In this paper, we propose a novel...
Pranab Mohanty, Rangachar Kasturi, Sudeep Sarkar
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
14 years 9 months ago
Industrial-Strength Schema Matching
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 6 months ago
Optimally Reconstructing Weighted Graphs Using Queries
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
Hanna Mazzawi