Sciweavers

1461 search results - page 148 / 293
» Complexity of Graph Covering Problems
Sort
View
TPCG
2003
IEEE
15 years 3 months ago
Guided Navigation in Task-Oriented 3D Graph Visualizations
In many application areas an optimal visualization of a complex graph depends on the specific task to be accomplished by the user. Therefore a means of locally customizable layou...
Guido Reina, Sven Lange-Last, Klaus D. Engel, Thom...
IRI
2007
IEEE
15 years 4 months ago
MAGIC: A Multi-Activity Graph Index for Activity Detection
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...
Massimiliano Albanese, Andrea Pugliese, V. S. Subr...
ICDCS
2011
IEEE
13 years 9 months ago
Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing
— In the emerging cloud computing paradigm, data owners become increasingly motivated to outsource their complex data management systems from local sites to the commercial public...
Ning Cao, Zhenyu Yang, Cong Wang, Kui Ren, Wenjing...
ACSAC
2003
IEEE
15 years 3 months ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...
SIAMDM
1998
89views more  SIAMDM 1998»
14 years 9 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky