Sciweavers

595 search results - page 59 / 119
» Incidence of
Sort
View
CPC
2007
125views more  CPC 2007»
15 years 6 months ago
Adversarial Deletion in a Scale-Free Random Graph Process
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
CTW
2007
91views more  CTW 2007»
15 years 6 months ago
Collaborative cross-checking to enhance resilience
Resilience, the ability to adapt or absorb disturbance, disruption, and change, may be increased by team processes in a complex, socio-technical system. In particular, collaborativ...
Emily S. Patterson, David D. Woods, Richard I. Coo...
KBS
2008
83views more  KBS 2008»
15 years 6 months ago
Rule-based and case-based reasoning approach for internal audit of bank
Banks currently have a great interest in internal audits to reduce risks, to prevent themselves from insolvency, and to take quick action for financial incidents. This study prese...
Gun Ho Lee
JUCS
2006
138views more  JUCS 2006»
15 years 6 months ago
Analysing Data of Childhood Acute Lymphoid Leukaemia by Seasonal Time Series Methods
: We examined the periodicity of the childhood leukaemia in Hungary using seasonal decomposition time series. Between 1988 and 2000 the number of annually diagnosed leukaemia (inci...
Maria Fazekas
SIAMDM
2008
84views more  SIAMDM 2008»
15 years 6 months ago
Long Local Searches for Maximal Bipartite Subgraphs
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
Hemanshu Kaul, Douglas B. West