Sciweavers

594 search results - page 33 / 119
» A Note on Concepts and Distances
Sort
View
SAGA
2007
Springer
14 years 1 months ago
Approximate Discovery of Random Graphs
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
Thomas Erlebach, Alexander Hall, Matús Miha...
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 7 months ago
Decoder Error Probability of MRD Codes
In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. Using this new concept, we derive proper...
Maximilien Gadouleau, Zhiyuan Yan
IFIP
2003
Springer
14 years 27 days ago
TAPI: Transactions for Accessing Public Infrastructure
This paper describes TAPI, an offline scheme intended for general Internet-based micropayments. TAPI, which extends and combines concepts from the KeyNote Microchecks and OTPCoins...
Matt Blaze, John Ioannidis, Sotiris Ioannidis, Ang...
DAM
2008
103views more  DAM 2008»
13 years 7 months ago
Crown reductions for the Minimum Weighted Vertex Cover problem
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown r...
Miroslav Chlebík, Janka Chlebíkov&aa...
TCS
2002
13 years 7 months ago
A comparison of two approaches to pseudorandomness
The concept of pseudorandomness plays an important role in cryptography. In this note, we contrast the notions of complexity-theoretic pseudorandom strings (from algorithmic infor...
Yongge Wang