Sciweavers

1222 search results - page 78 / 245
» corr 2008
Sort
View
CORR
2008
Springer
147views Education» more  CORR 2008»
15 years 6 months ago
C-K-R Partitions of Sparse Graphs
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...
Manor Mendel, Chaya Schwob
CORR
2008
Springer
72views Education» more  CORR 2008»
15 years 6 months ago
Inferring Company Structure from Limited Available Information
: In this paper we present several algorithmic techniques for inferring the structure of a company when only a limited amount of information is available. We consider problems with...
Mugurel Ionut Andreica, Angela Andreica, Romulus A...
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 6 months ago
Packing multiway cuts in capacitated graphs
We consider the following "multiway cut packing" problem in undirected graphs: we are given a graph G = (V, E) and k commodities, each corresponding to a set of terminal...
Siddharth Barman, Shuchi Chawla
CORR
2008
Springer
52views Education» more  CORR 2008»
15 years 6 months ago
A static theory of promises
We discuss for the concept of promises within a framework that can be applied to either humans or technology. We compare promises to the more established notion of obligations and...
Jan A. Bergstra, Mark Burgess
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 6 months ago
Divisibility, Smoothness and Cryptographic Applications
This paper deals with products of moderate-size primes, familiarly known as smooth numbers. Smooth numbers play an crucial role in information theory, signal processing and crypto...
David Naccache, Igor Shparlinski