Sciweavers

409 search results - page 24 / 82
» Matching Scenarios with Timing Constraints
Sort
View
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
14 years 7 months ago
A gauss function based approach for unbalanced ontology matching
Ontology matching, aiming to obtain semantic correspondences between two ontologies, has played a key role in data exchange, data integration and metadata management. Among numero...
Qian Zhong, Hanyu Li, Juanzi Li, Guo Tong Xie, Jie...
IPSN
2009
Springer
14 years 2 months ago
Distributed resource management and matching in sensor networks
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
ICALP
2001
Springer
14 years 4 days ago
Permutation Editing and Matching via Embeddings
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...
CIKM
2007
Springer
14 years 1 months ago
Parallel linkage
We study the parallelization of the (record) linkage problem – i.e., to identify matching records between two collections of records, A and B. One of main idiosyncrasies of the ...
Hung-sik Kim, Dongwon Lee
MSWIM
2006
ACM
14 years 1 months ago
Pattern matching based link quality prediction in wireless mobile ad hoc networks
As mobile devices, such as laptops, PDAs or mobile phones, are getting more and more ubiquitous and are able to communicate with each other via wireless technologies, the paradigm...
Károly Farkas, Theus Hossmann, Lukas Ruf, B...