Sciweavers

7913 search results - page 178 / 1583
» Information Collection on a Graph
Sort
View
EDBT
2009
ACM
132views Database» more  EDBT 2009»
14 years 5 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
GLOBECOM
2009
IEEE
14 years 5 months ago
Impact of Information on Network Performance - An Information-Theoretic Perspective
Abstract—Available network information is an important factor in determining network performance. In this paper, we study the basic limits on the amount of network information th...
Jun Hong, Victor O. K. Li
ISI
2005
Springer
14 years 3 months ago
Filtering, Fusion and Dynamic Information Presentation: Towards a General Information Firewall
Intelligence analysts are flooded with massive amounts of data from a multitude of sources and in many formats. From this raw data they attempt to gain insight that will provide de...
Gregory J. Conti, Mustaque Ahamad, Robert Norback
ALGORITHMICA
2011
13 years 5 months ago
On Dissemination Thresholds in Regular and Irregular Graph Classes
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...
Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques...
WEA
2005
Springer
117views Algorithms» more  WEA 2005»
14 years 3 months ago
Vertex Cover Approximations: Experiments and Observations
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
Eyjolfur Asgeirsson, Clifford Stein