Sciweavers

2304 search results - page 323 / 461
» On the Vulnerability of Large Graphs
Sort
View
WSC
2008
15 years 11 days ago
Using OMG'S SYSML to support simulation
Currently, system engineering problems are solved using a wide range of domain-specific models and corresponding languages. It is unlikely that a single unified modeling language ...
Christiaan J. J. Paredis, Thomas Johnson
CCS
2008
ACM
15 years 1 days ago
Assessing query privileges via safe and efficient permission composition
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
Sabrina De Capitani di Vimercati, Sara Foresti, Su...
CONCUR
2006
Springer
15 years 2 hour ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
14 years 11 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
APVIS
2008
14 years 11 months ago
Interactive Visual Analysis of the NSF Funding Information
This paper presents an interactive visualization toolkit for navigating and analyzing the National Science Foundation (NSF) funding information. Our design builds upon the treemap...
Shixia Liu, Nan Cao, Hao Lv