Sciweavers

1225 search results - page 212 / 245
» The Instance Complexity Conjecture
Sort
View
CLUSTER
2000
IEEE
13 years 7 months ago
Dynamic Max-Min fairness in ring networks
Ring networks are enjoying renewed interest as Storage Area Networks (SANs), i.e., networks for interconnecting storage devices (e.g., disk, disk arrays and tape drives) and stora...
Giuseppe Anastasi, Luciano Lenzini, M. La Porta, Y...
ML
1998
ACM
13 years 7 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...
CORR
2010
Springer
62views Education» more  CORR 2010»
13 years 7 months ago
Asymptotically-Good, Multigroup ML-Decodable STBCs
For a family/sequence of Space-Time Block Codes (STBCs) C1, C2, . . . , with increasing number of transmit antennas Ni, with rates Ri complex symbols per channel use, i = 1, 2, . ....
Natarajan Lakshmi Prasad, B. Sundar Rajan
PVLDB
2008
160views more  PVLDB 2008»
13 years 7 months ago
BayesStore: managing large, uncertain data repositories with probabilistic graphical models
Several real-world applications need to effectively manage and reason about large amounts of data that are inherently uncertain. For instance, pervasive computing applications mus...
Daisy Zhe Wang, Eirinaios Michelakis, Minos N. Gar...
PVLDB
2010
151views more  PVLDB 2010»
13 years 6 months ago
Advanced Processing for Ontological Queries
Ontology-based data access is a powerful form of extending database technology, where a classical extensional database (EDB) is enhanced by an ontology that generates new intensio...
Andrea Calì, Georg Gottlob, Andreas Pieris