Sciweavers

246 search results - page 19 / 50
» Stable domination and weight
Sort
View
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
14 years 3 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
14 years 10 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
CVPR
2008
IEEE
13 years 11 months ago
Probabilistic multi-tensor estimation using the Tensor Distribution Function
Diffusion weighted magnetic resonance (MR) imaging is a powerful tool that can be employed to study white matter microstructure by examining the 3D displacement profile of water m...
Alex D. Leow, Siwei Zhu, Katie McMahon, Greig I. d...
RECOMB
2006
Springer
14 years 10 months ago
Probabilistic Paths for Protein Complex Inference
Understanding how individual proteins are organized into complexes and pathways is a significant current challenge. We introduce new algorithms to infer protein complexes by combin...
Hailiang Huang, Lan V. Zhang, Frederick P. Roth, J...
COMPSEC
2010
122views more  COMPSEC 2010»
13 years 8 months ago
Taming role mining complexity in RBAC
In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to rol...
Alessandro Colantonio, Roberto Di Pietro, Alberto ...