1538 search results - page 272 / 308 » Relative Randomness and Cardinality |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
SIGIR
2009
ACM
15 years 4 months ago
2009
ACM
It is now widely recognized that user interactions with search results can provide substantial relevance information on the documents displayed in the search results. In this pape...
111
click to vote
LCN
2008
IEEE
15 years 4 months ago
2008
IEEE
—Bandwidth estimation techniques seek to provide an accurate estimation of available bandwidth such that network applications can adjust their behavior accordingly. However, most...
98
Voted
BIBE
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper, we propose a system for finding partial positive and negative coregulated gene clusters in microarray data. Genes are clustered together if they show the same p...