Sciweavers

1056 search results - page 146 / 212
» Constraint-Based Graph Matching
Sort
View
INFOCOM
2002
IEEE
14 years 2 months ago
On Distinguishing between Internet Power Law Topology Generators
— Recent work has shown that the node degree in the WWW induced graph and the AS-level Internet topology exhibit power laws. Since then several algorithms have been proposed to g...
Tian Bu, Donald F. Towsley
FOCS
1999
IEEE
14 years 1 months ago
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...
V. S. Anil Kumar, H. Ramesh
ESWS
2006
Springer
14 years 23 days ago
An Iterative Algorithm for Ontology Mapping Capable of Using Training Data
We present a new iterative algorithm for ontology mapping where we combine standard string distance metrics with a structural similarity measure that is based on a vector represent...
Andreas Heß
ASPDAC
2005
ACM
111views Hardware» more  ASPDAC 2005»
13 years 11 months ago
Placement with symmetry constraints for analog layout design using TCG-S
In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module...
Jai-Ming Lin, Guang-Ming Wu, Yao-Wen Chang, Jen-Hu...
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 9 months ago
Rate and power allocation under the pairwise distributed source coding constraint
We explore the problem of rate and power allocation for a sensor network where pairwise distributed source coding is employed (introduced by Roumy and Gesbert `07). For noiseless n...
Shizheng Li, Aditya Ramamoorthy