Sciweavers

1722 search results - page 80 / 345
» Variables in Concept Graphs
Sort
View
124
Voted
OPODIS
2008
15 years 5 months ago
Graph Augmentation via Metric Embedding
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
Emmanuelle Lebhar, Nicolas Schabanel
CORR
2007
Springer
149views Education» more  CORR 2007»
15 years 3 months ago
Graph Entropy, Network Coding and Guessing games
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
Søren Riis
147
Voted
PVLDB
2010
152views more  PVLDB 2010»
15 years 1 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
129
Voted
SOFTVIS
2006
ACM
15 years 9 months ago
Evolutionary layout: preserving the mental map during the development of class models
It is vital for any developer to keep track of changes during his project. Thus, it is common practice to take static snapshots of single class diagrams. But to preserve the menta...
Susanne Jucknath-John, Dennis Graf, Gabriele Taent...
123
Voted
ISCAS
2005
IEEE
147views Hardware» more  ISCAS 2005»
15 years 9 months ago
A heuristic approach for multiple restricted multiplication
— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied...
Nalin Sidahao, George A. Constantinides, Peter Y. ...