Sciweavers

2899 search results - page 382 / 580
» Dynamic Trees in Practice
Sort
View
STOC
1997
ACM
111views Algorithms» more  STOC 1997»
14 years 2 months ago
The Swendsen-Wang Process Does Not Always Mix Rapidly
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
Vivek Gore, Mark Jerrum
RECOMB
1997
Springer
14 years 2 months ago
Progressive multiple alignment with constraints
A progressive alignment algorithm produces a multi-alignment of a set of sequences by repeatedly aligning pairs of sequences and/or previously generated alignments. We describe a ...
Gene Myers, Sanford Selznick, Zheng Zhang 0004, We...
SP
1990
IEEE
14 years 2 months ago
Some Conundrums Concerning Separation of Duty
This paper examines some questions concerning commercial computer security integrity policies. We give an example of a dynamic separation of duty policy which cannot be implemente...
M. J. Nash, K. R. Poland
AGILEDC
2004
IEEE
14 years 2 months ago
An Initial Exploration of the Relationship Between Pair Programming and Brooks' Law
Through his law, "adding manpower to a late software project makes it later," Brooks asserts that the assimilation, training, and intercommunication costs of adding new ...
Laurie A. Williams, Anuja Shukla, Annie I. Ant&oac...
APSEC
2004
IEEE
14 years 2 months ago
JCMP: Linking Architecture with Component Building
Approaches to enforcing communication integrity in the implementation, exemplified by ArchJava, consider only architectural constraints, without taking into account the late integ...
Guoqing Xu, Zongyuan Yang, Haitao Huang