Sciweavers

478 search results - page 28 / 96
» Measuring the Similarity of Labeled Graphs
Sort
View
CORR
2010
Springer
81views Education» more  CORR 2010»
13 years 9 months ago
Relaxation-based coarsening and multiscale graph organization
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
Dorit Ron, Ilya Safro, Achi Brandt
ICNP
1998
IEEE
14 years 1 months ago
A State Management Protocol for IntServ, DiffServ and Label Switching
Providing Quality of Service (QOS) in an efficient and scalable manner in the Internet is a topic of active research. The technologies that have drawn the most attention are Integ...
Hari Adiseshu, Guru M. Parulkar, Raj Yavatkar
MM
2005
ACM
134views Multimedia» more  MM 2005»
14 years 3 months ago
Formulating context-dependent similarity functions
Tasks of information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be formulated in a con...
Gang Wu, Edward Y. Chang, Navneet Panda
ENTCS
2010
133views more  ENTCS 2010»
13 years 9 months ago
Towards Measurable Types for Dynamical Process Modeling Languages
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
Eric Mjolsness
BIBE
2006
IEEE
154views Bioinformatics» more  BIBE 2006»
14 years 3 months ago
Determining Molecular Similarity for Drug Discovery using the Wavelet Riemannian Metric
Discerning the similarity between two molecules is a challenging problem in drug discovery as well as in molecular biology. The importance of this problem is due to the fact that ...
Elinor Velasquez, Emmanuel R. Yera, Rahul Singh