Sciweavers

289 search results - page 51 / 58
» A Framework for Visualising Large Graphs
Sort
View
PODS
1991
ACM
98views Database» more  PODS 1991»
15 years 1 months ago
Minimum and Maximum Predicates in Logic Programming
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...
Sumit Ganguly, Sergio Greco, Carlo Zaniolo
93
Voted
CCS
2008
ACM
14 years 11 months ago
Measuring network security using dynamic bayesian network
Given the increasing dependence of our societies on networked information systems, the overall security of these systems should be measured and improved. Existing security metrics...
Marcel Frigault, Lingyu Wang, Anoop Singhal, Sushi...
PODC
2010
ACM
14 years 11 months ago
Brief announcement: adaptive content placement for peer-to-peer video-on-demand systems
In this paper, we address the problem of content placement in peer-to-peer systems, with the objective of maximizing the utilization of peers' uplink bandwidth resources. We ...
Bo Tan, Laurent Massoulié
IADIS
2004
14 years 11 months ago
The outline of an 'intelligent' image retrieval engine
The first image retrieval systems hold the advantage of being fully automatic, and thus scalable to large collections of images but are restricted to the representation of low-lev...
Mohammed Belkhatir, Philippe Mulhem, Yves Chiarame...
IJHPCA
2006
125views more  IJHPCA 2006»
14 years 9 months ago
Complexity Results for Collective Communications on Heterogeneous Platforms
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
Olivier Beaumont, Loris Marchal, Yves Robert