Sciweavers

7913 search results - page 36 / 1583
» Information Collection on a Graph
Sort
View
SPAA
2003
ACM
14 years 24 days ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
AMKM
2003
Springer
14 years 24 days ago
A Spreading Activation Framework for Ontology-Enhanced Adaptive Information Access within Organisations
This research investigates a unique Indexing Structure and Navigational Interface which integrates (1) ontology-driven knowledge-base (2) statistically derived indexing parameters...
Md Maruf Hasan
LCPC
1994
Springer
13 years 11 months ago
Optimizing Array Distributions in Data-Parallel Programs
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
Krishna Kunchithapadam, Barton P. Miller
KDD
2010
ACM
327views Data Mining» more  KDD 2010»
13 years 11 months ago
Cold start link prediction
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely ...
Vincent Leroy, Berkant Barla Cambazoglu, Francesco...
MICRO
2009
IEEE
132views Hardware» more  MICRO 2009»
14 years 2 months ago
Finding concurrency bugs with context-aware communication graphs
Incorrect thread synchronization often leads to concurrency bugs that manifest nondeterministically and are difficult to detect and fix. Past work on detecting concurrency bugs ...
Brandon Lucia, Luis Ceze