4048 search results - page 312 / 810 » Design Science, Engineering Science and Requirements Enginee... |
167
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
152
click to vote
TCC
2009
Springer
16 years 5 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
268
click to vote
POPL
2004
ACM
16 years 5 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
130
Voted
CSE
2009
IEEE
15 years 11 months ago
2009
IEEE
—Group-Centric Secure Information Sharing (g-SIS) is motivated by the need to dynamically share information amongst a set of authorized users for a specific purpose. Authorized ...
156
click to vote
ICDM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...