Sciweavers

2304 search results - page 287 / 461
» On the Vulnerability of Large Graphs
Sort
View
PAKDD
2010
ACM
222views Data Mining» more  PAKDD 2010»
15 years 11 months ago
Online Sampling of High Centrality Individuals in Social Networks
In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
Arun S. Maiya, Tanya Y. Berger-Wolf
DAC
1997
ACM
15 years 10 months ago
Equivalence Checking Using Cuts and Heaps
This paper presents a verification technique which is specifically targeted to formally comparing large combinational circuits with some structural similarities. The approach co...
Andreas Kuehlmann, Florian Krohm
CSFW
2004
IEEE
15 years 10 months ago
From Stack Inspection to Access Control: A Security Analysis for Libraries
We present a new static analysis for reviewing the security of libraries for systems, such as JVMs or the CLR, that rely on stack inspection for access control. We describe its im...
Frédéric Besson, Tomasz Blanc, C&eac...
SPDP
1991
IEEE
15 years 10 months ago
Asynchronous parallel search by the parallel genetic algorithm
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
Heinz Mühlenbein
AAAI
2006
15 years 8 months ago
Identifying and Generating Easy Sets of Constraints for Clustering
Clustering under constraints is a recent innovation in the artificial intelligence community that has yielded significant practical benefit. However, recent work has shown that fo...
Ian Davidson, S. S. Ravi