Sciweavers

271 search results - page 52 / 55
» Quasi-isometries between graphs and trees
Sort
View
JCIT
2008
138views more  JCIT 2008»
13 years 7 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
CIKM
2005
Springer
14 years 1 months ago
Semantic similarity over the gene ontology: family correlation and selecting disjunctive ancestors
Many bioinformatics applications would benefit from comparing proteins based on their biological role rather than their sequence. In most biological databases, proteins are alrea...
Francisco M. Couto, Mário J. Silva, Pedro C...
WOSP
2005
ACM
14 years 1 months ago
From UML to LQN by XML algebra-based model transformations
The change of focus from code to models promoted by OMG's Model Driven Development raises the need for verification of nonfunctional characteristics of UML models, such as pe...
Gordon Ping Gu, Dorina C. Petriu
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 2 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
ICML
2004
IEEE
14 years 8 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall