Sciweavers

15375 search results - page 217 / 3075
» cans 2008
Sort
View
TFS
2008
109views more  TFS 2008»
13 years 6 months ago
Comments on "Fuzzy Probabilistic Approximation Spaces and Their Information Measures"
Some errors in our original paper in defining relative reduct with information measures are pointed out in this paper. It is shown that in our original work, Theorems 10 and 19 hol...
Qinghua Hu, Zongxia Xie, Daren Yu
JSC
2010
132views more  JSC 2010»
13 years 6 months ago
Binary codes from the line graph of the n-cube
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
W. Fish, Jennifer D. Key, E. Mwambene
OL
2010
185views more  OL 2010»
13 years 6 months ago
On the Hamming distance in combinatorial optimization problems on hypergraph matchings
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. P...
PVLDB
2010
120views more  PVLDB 2010»
13 years 6 months ago
Cloudy: A Modular Cloud Storage System
This demonstration presents Cloudy, a modular cloud storage system. Cloudy provides a highly flexible architecture for distributed data storage and is designed to operate with mu...
Donald Kossmann, Tim Kraska, Simon Loesing, Stepha...
SIGACT
2010
74views more  SIGACT 2010»
13 years 6 months ago
Typically-correct derandomization
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
Ronen Shaltiel