Sciweavers

1290 search results - page 17 / 258
» Popular Matchings: Structure and Algorithms
Sort
View
DCC
2010
IEEE
15 years 4 months ago
Block Compressed Sensing of Images Using Directional Transforms
Block-based random image sampling is coupled with a projectiondriven compressed-sensing recovery that encourages sparsity in the domain of directional transforms simultaneously wi...
Sungkwang Mun, James E. Fowler
VLDB
2000
ACM
99views Database» more  VLDB 2000»
15 years 1 months ago
Efficient Filtering of XML Documents for Selective Dissemination of Information
Information Dissemination applications are gaining increasing popularity due to dramatic improvements in communications bandwidth and ubiquity. The sheer volume of data available ...
Mehmet Altinel, Michael J. Franklin
CONEXT
2008
ACM
14 years 11 months ago
ISP-friendly peer matching without ISP collaboration
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
Cheng-Hsin Hsu, Mohamed Hefeeda
ESWS
2004
Springer
15 years 2 months ago
S-Match: an Algorithm and an Implementation of Semantic Matching
Abstract. We think of Match as an operator which takes two graph-like structures and produces a mapping between those nodes of the two graphs that correspond semantically to each o...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...
FLAIRS
2004
14 years 11 months ago
ABSURDIST II: A Graph Matching Algorithm and its Application to Conceptual System Translation
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
Ying Feng, Robert L. Goldstone, Vladimir Menkov