text
stringlengths 5
219
| idx
int64 0
169k
|
---|---|
evasion attacks against machine learning at test time | 0 |
how hard is computing parity with noisy communications | 1 |
on the absence of the rip in real world applications of compressed sensing and the rip in levels | 2 |
a promise theory perspective on data networks | 3 |
analysis of asymptotically optimal sampling based motion planning algorithms for lipschitz continuous dynamical systems | 4 |
the edge group coloring problem with applications to multicast switching | 5 |
webvrgis based city bigdata 3d visualization and analysis | 6 |
information theoretic authentication and secrecy codes in the splitting model | 7 |
whealth transforming telehealth services | 8 |
nonparametric decentralized sequential detection via universal source coding | 9 |
online learning in decentralized multiuser resource sharing problems | 10 |
truthful secretaries with budgets | 11 |
improving the bound on the rip constant in generalized orthogonal matching pursuit | 12 |
a system for reflection in c | 13 |
a bi level view of inpainting based image compression | 14 |
distributed graph automata | 15 |
randomness efficient rumor spreading | 16 |
back to the past source identification in diffusion networks from partially observed cascades | 17 |
bayesian two sample tests | 18 |
electrical structure based pmu placement in electric power systems | 19 |
on state dependent broadcast channels with cooperation | 20 |
detecting simultaneous integer relations for several real vectors | 21 |
shannon meets carnot mutual information via thermodynamics | 22 |
on list decodability of random rank metric codes | 23 |
dealing with run time variability in service robotics towards a dsl for non functional properties | 24 |
a characterisation of context sensitive languages by consensus games | 25 |
data structures for approximate range counting | 26 |
holographic transformation for quantum factor graphs | 27 |
rooted trees with probabilities revisited | 28 |
time critical social mobilization | 29 |
homomorphic encryption theory and application | 30 |
learning transformations for clustering and classification | 31 |
methods for integrating knowledge with the three weight optimization algorithm for hybrid cognitive processing | 32 |
csma local area networking under dynamic altruism | 33 |
face frontalization for alignment and recognition | 34 |
from bounded affine types to automatic timing analysis | 35 |
an efficient way to perform the assembly of finite element matrices in matlab and octave | 36 |
how auto encoders could provide credit assignment in deep networks via target propagation | 37 |
constrained parametric proposals and pooling methods for semantic segmentation in rgb d images | 38 |
cooperative game theoretic solution concepts for top k problems | 39 |
regulation and the integrity of spreadsheets in the information supply chain | 40 |
reconfigurable wireless networks | 41 |
contact representations of sparse planar graphs | 42 |
modularity aspects of disjunctive stable models | 43 |
replica symmetric bound for restricted isometry constant | 44 |
pushdown abstractions of javascript | 45 |
a notion of robustness for cyber physical systems | 46 |
entropy rate for hidden markov chains with rare transitions | 47 |
memristors can implement fuzzy logic | 48 |
asymptotic capacity of wireless ad hoc networks with realistic links under a honey comb topology | 49 |
on the performance of selection cooperation with imperfect channel estimation | 50 |
informetric analyses of knowledge organization systems koss | 51 |
latent topic models for hypertext | 52 |
complete security framework for wireless sensor networks | 53 |
neural dissimilarity indices that predict oddball detection in behaviour | 54 |
network maps of technology fields a comparative analysis of relatedness measures | 55 |
continuous double auction mechanism and bidding strategies in cloud computing markets | 56 |
the abc problem for gabor systems | 57 |
inference less density estimation using copula bayesian networks | 58 |
optimal detection of intersections between convex polyhedra | 59 |
limits of rush hour logic complexity | 60 |
new separation between s f and bs f | 61 |
a survey on handover management in mobility architectures | 62 |
many task computing and blue waters | 63 |
identifying reliable annotations for large scale image segmentation | 64 |
improved analysis for subspace pursuit algorithm in terms of restricted isometry constant | 65 |
squares of 3 sun free split graphs | 66 |
tree dynamics for peer to peer streaming | 67 |
stochastic ordering of interferences in large scale wireless networks | 68 |
earthquake disaster based efficient resource utilization technique in iaas cloud | 69 |
on descriptional complexity of the planarity problem for gauss words | 70 |
multi access mimo systems with finite rate channel state feedback | 71 |
an information theoretic perspective of the poisson approximation via the chen stein method | 72 |
a set and collection lemma | 73 |
learning economic parameters from revealed preferences | 74 |
towards adapting imagenet to reality scalable domain adaptation with implicit low rank transformations | 75 |
using multiple criteria methods to evaluate community partitions | 76 |
incremental adaptation strategies for neural network language models | 77 |
optimal point to point codes in interference channels an incremental i mmse approach | 78 |
a combined approach for constraints over finite domains and arrays | 79 |
optimization design and analysis of systematic lt codes over awgn channel | 80 |
truth and envy in capacitated allocation games | 81 |
smt based bounded model checking of fixed point digital controllers | 82 |
google matrix of business process management | 83 |
a combinatorial algebraic approach for the identifiability of low rank matrix completion | 84 |
iterated ld problem in non associative key establishment | 85 |
towards ontological support for principle solutions in mechanical engineering | 86 |
formation of robust multi agent networks through self organizing random regular graphs | 87 |
fully dynamic bin packing revisited | 88 |
throughput capacity of two hop relay manets under finite buffers | 89 |
bounds on the capacity of ask molecular communication channels with isi | 90 |
ranking the importance level of intermediaries to a criminal using a reliance measure | 91 |
approximating the diameter of a graph | 92 |
weight assignment logic | 93 |
fast label embeddings for extremely large output spaces | 94 |
flaglets exact wavelets on the ball | 95 |
a sparse bayesian framework for conditioning uncertain geologic models to nonlinear flow measurements | 96 |
paxoslease diskless paxos for leases | 97 |
learning kernel based halfspaces with the zero one loss | 98 |
on the optimality of simple schedules for networks with multiple half duplex relays | 99 |
End of preview. Expand
in Dataset Viewer.
README.md exists but content is empty.
Use the Edit dataset card button to edit it.
- Downloads last month
- 37