Sciweavers

1511 search results - page 46 / 303
» Randomness, lowness and degrees
Sort
View
LOGCOM
2007
72views more  LOGCOM 2007»
14 years 11 months ago
Post's Programme for the Ershov Hierarchy
This paper extends Post’s programme to finite levels of the Ershov hierarchy of ∆2 sets. Our initial characterisation, in the spirit of Post [27], of the degrees of the immune...
Bahareh Afshari, George Barmpalias, S. Barry Coope...
QSHINE
2005
IEEE
15 years 5 months ago
Adaptive Low-Complexity Erasure-Correcting Code-Based Protocols for QoS-Driven Mobile Multicast Services
—We propose an adaptive hybrid automatic repeat request–forward error correction (ARQ–FEC) erasure-correcting scheme for quality of service (QoS)-driven mobile multicast serv...
Qinghe Du, Xi Zhang
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
13 years 2 months ago
Low rank modeling of signed networks
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
15 years 3 months ago
Extractors for Low-Weight Affine Sources
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
Anup Rao
IPPS
2010
IEEE
14 years 9 months ago
A PRAM-NUMA model of computation for addressing low-TLP workloads
It is possible to implement the parallel random access machine (PRAM) on a chip multiprocessor (CMP) efficiently with an emulated shared memory (ESM) architecture to gain easy par...
Martti Forsell