Sciweavers

1272 search results - page 82 / 255
» Approximate Parameterized Matching
Sort
View
DCC
2004
IEEE
15 years 11 months ago
An Approximation to the Greedy Algorithm for Differential Compression of Very Large Files
We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. Differential compression refers to encodi...
Ramesh C. Agarwal, Suchitra Amalapurapu, Shaili Ja...
VLDB
2007
ACM
159views Database» more  VLDB 2007»
15 years 11 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...
SSDBM
2007
IEEE
118views Database» more  SSDBM 2007»
15 years 5 months ago
Database Support for Weighted Match Joins
As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics ...
Ameet Kini, Jeffrey F. Naughton
SEMWEB
2007
Springer
15 years 5 months ago
Structure Preserving Semantic Matching
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...
JDA
2008
101views more  JDA 2008»
14 years 11 months ago
Student-Project Allocation with preferences over Projects
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
David Manlove, Gregg O'Malley