2638 search results - page 348 / 528 » Random Geometric Complexes |
136
click to vote
TVCG
2012
13 years 5 months ago
2012
—In this paper, we study the sensitivity of centrality metrics as a key metric of social networks to support visual reasoning. As centrality represents the prestige or importance...
156
click to vote
EUROCRYPT
2012
Springer
13 years 5 months ago
2012
Springer
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ËœO(Î...
123
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
120
click to vote
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
The presence of highlights, which in dielectric inhomogeneous objects are linear combination of specular and diffuse reflection components, is inevitable. A number of methods have...
151
Voted
MOBIHOC
2002
ACM
16 years 2 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...