94 search results - page 14 / 19 » Testing Whether a Set of Code Words Satisfies a Given Set of... |
PKC
1999
Springer
14 years 9 days ago
1999
Springer
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
ADHOCNOW
2008
Springer
14 years 2 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
WAW
2004
Springer
14 years 1 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...