Sciweavers

2004 search results - page 248 / 401
» Sampling from large graphs
Sort
View
EUROSEC
2009
ACM
15 years 10 months ago
QuanTM: a quantitative trust management system
Quantitative Trust Management (QTM) provides a dynamic interpretation of authorization policies for access control decisions based on upon evolving reputations of the entities inv...
Andrew G. West, Adam J. Aviv, Jian Chang, Vinayak ...
141
Voted
GECCO
2004
Springer
15 years 8 months ago
Real-Coded Bayesian Optimization Algorithm: Bringing the Strength of BOA into the Continuous World
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
Chang Wook Ahn, Rudrapatna S. Ramakrishna, David E...
FPL
2001
Springer
96views Hardware» more  FPL 2001»
15 years 8 months ago
System Level Tools for DSP in FPGAs
Abstract. Visual data ow environments are ideally suited for modeling digital signal processing (DSP) systems, as many DSP algorithms are most naturally speci ed by signal ow gra...
James Hwang, Brent Milne, Nabeel Shirazi, Jeffrey ...
126
Voted
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
15 years 7 months ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
LATIN
1998
Springer
15 years 7 months ago
Short and Smooth Polygonal Paths
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
James Abello, Emden R. Gansner