Sciweavers

672 search results - page 31 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
CL
2012
Springer
11 years 10 months ago
Object swapping challenges: An evaluation of imageSegment
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph...
Mariano Martinez Peck, Noury Bouraqadi, Sté...
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
14 years 8 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
ATAL
2008
Springer
13 years 9 months ago
Decentralised coordination of low-power embedded devices using the max-sum algorithm
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
Alessandro Farinelli, Alex Rogers, Adrian Petcu, N...
DAC
2009
ACM
14 years 2 months ago
Information hiding for trusted system design
For a computing system to be trusted, it is equally important to verify that the system performs no more and no less functionalities than desired. Traditional testing and verifica...
Junjun Gu, Gang Qu, Qiang Zhou
ISBRA
2009
Springer
14 years 2 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...