Sciweavers

4343 search results - page 160 / 869
» Improving Visual Matching
Sort
View
CSB
2003
IEEE
15 years 8 months ago
Fast and Sensitive Probe Selection for DNA Chips Using Jumps in Matching Statistics
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
Sven Rahmann
SEMWEB
2009
Springer
15 years 7 months ago
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases
RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophis...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
SEMWEB
2009
Springer
15 years 7 months ago
A Weighted Approach to Partial Matching for Mobile Reasoning
Due to significant improvements in the capabilities of small devices such as PDAs and smart phones, these devices can not only consume but also provide Web Services. The dynamic n...
Luke Albert Steller, Shonali Krishnaswamy, Mohamed...
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 3 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy
TKDE
2008
121views more  TKDE 2008»
15 years 2 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton