Sciweavers

871 search results - page 144 / 175
» The vertex-cover polynomial of a graph
Sort
View
CCS
2008
ACM
14 years 11 months ago
Assessing query privileges via safe and efficient permission composition
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
Sabrina De Capitani di Vimercati, Sara Foresti, Su...
CVPR
2010
IEEE
14 years 11 months ago
Simultaneous Searching of Globally Optimal Interacting Surfaces with Shape Priors
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
Qi Song, Xiaodong Wu, Yunlong Liu, Mona Garvin, Mi...
99
Voted
DAGSTUHL
2007
14 years 11 months ago
A Deeper Investigation of PageRank as a Function of the Damping Factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spre...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
CLASSIFICATION
2008
68views more  CLASSIFICATION 2008»
14 years 9 months ago
The Metric Cutpoint Partition Problem
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
Alain Hertz, Sacha Varone
JACM
2007
115views more  JACM 2007»
14 years 9 months ago
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
Éric Colin de Verdière, Francis Laza...