Filters








145 Hits in 6.0 sec

Open Identity Summit 2021 - Complete Volume

2021 Open Identity Summit  
processed, the governance of personal information in data lakes has received only cursory attention.  ...  While it has been noted in earlier work that data governance is central for the successful operation of a data lake, and that privacy is a central issue in such a setting as personal information may be  ...  self-determination 129 project.  ... 
dblp:conf/openidentity/X21 fatcat:o54xtce6rneehgbbpsr3vasvvq

An Overview of Neural Network Compression [article]

James O' Neill
2020 arXiv   pre-print
We assume a basic familiarity with deep learning architectures[%s], namely, Recurrent Neural Networks , Convolutional Neural Networks [%s] and Self-Attention based networks [%s],[%s].  ...  Hence, this paper provides a timely overview of both old and current compression techniques for deep neural networks, including pruning, quantization, tensor decomposition, knowledge distillation and combinations  ...  Equation 43 shows the PSO update formula where the velocity V id for i-th position of particle X i d (i.e a parameter vector in a DNN) at the d-th iteration, V id := V id + c 1 u(P id − X id ) + c 2 u  ... 
arXiv:2006.03669v2 fatcat:u2p6gvwhobh53hfjxawzclw7fq

Learning Neural Textual Representations for Citation Recommendation

Binh Thanh Kieu, Inigo Jauregi Unanue, Son Bao Pham, Hieu Xuan Phan, Massimo Piccardi
2021 2020 25th International Conference on Pattern Recognition (ICPR)  
Module for Person Re-Identification DAY 4 -Jan 15, 2021 Liu, Hong; Miao, Ziling; Yang, Bing; Ding, Runwei 2104 A Base-Derivative Framework for Cross-Modality RGB-Infrared Person Re-Identification DAY  ...  Compact Feature Learning for RGB-Infrared Person Re-Identification DAY 2 -Jan 13, 2021 Ha, Thi Phuong Thao; Balamurali, BT; Dorien, Herremans; Gemma, Roig 2392 AttendAffectNet: Self-Attention  ... 
doi:10.1109/icpr48806.2021.9412725 fatcat:3vge2tpd2zf7jcv5btcixnaikm

Learning to recognize valuable tags

Shilad Sen, Jesse Vig, John Riedl
2008 Proceedingsc of the 13th international conference on Intelligent user interfaces - IUI '09  
We chose a tag selection algorithm for a user id and movie id using a pseudorandom hashing function 19 that deterministically assigned a particular user id and movie id to an experimental group.  ...  Metrics We experimented with three metrics that distill tag selection algorithm performance to a single score.  ... 
doi:10.1145/1502650.1502666 dblp:conf/iui/SenVR09 fatcat:2uokmw5y35exrh5gwkd2ad5i7e

2020 Index IEEE Signal Processing Letters Vol. 27

2020 IEEE Signal Processing Letters  
Tu, Z., +, LSP 2020 1715-1719 Adaptively Leverage Unlabeled Tracklets Based on Part Attention Model for Few-Example Re-ID.  ...  Majorkowska-Mech, D., +, LSP 2020 1195-1199 Generated Data With Sparse Regularized Multi-Pseudo Label for Person Re-Identification.  ... 
doi:10.1109/lsp.2021.3055468 fatcat:wfdtkv6fmngihjdqultujzv4by

The Critical Resource Theory of Fiduciary Duty

D. Gordon Smith
2002 Social Science Research Network  
RES. L.  ...  id. § 8 (power "by transactions with third persons, professedly as agent for the other, arising from and in accordance with the other's manifestations to such third persons"); and on inherent agency power  ... 
doi:10.2139/ssrn.339100 fatcat:ex7ifzccnngkjm3qjmz3ngdkve

Transformers in Vision: A Survey [article]

Salman Khan, Muzammal Naseer, Munawar Hayat, Syed Waqas Zamir, Fahad Shahbaz Khan, Mubarak Shah
2021 arXiv   pre-print
We start with an introduction to fundamental concepts behind the success of Transformers i.e., self-attention, large-scale pre-training, and bidirectional encoding.  ...  We would also like to thank Mohamed Afham for his help with a figure.  ...  Similarly, [260] uses a Jigsaw puzzle based self-supervision loss as a parallel branch in the Transformers to improve person re-identification.  ... 
arXiv:2101.01169v4 fatcat:ynsnfuuaize37jlvhsdki54cy4

2021 Index IEEE Transactions on Neural Networks and Learning Systems Vol. 32

2021 IEEE Transactions on Neural Networks and Learning Systems  
Quan, Y., +, TNNLS May 2021 1852-1865 Weakly Supervised Person Re-ID: Differentiable Graphical Learning and a New Benchmark.  ...  Liu, L., +, TNNLS June 2021 2306-2319 Weakly Supervised Person Re-ID: Differentiable Graphical Learning and a New Benchmark.  ... 
doi:10.1109/tnnls.2021.3134132 fatcat:2e7comcq2fhrziselptjubwjme

Assumptions in Quantum Cryptography [article]

Normand J. Beaudry
2015 arXiv   pre-print
Along with the review, we propose a framework that decomposes quantum-key-distribution protocols and their assumptions into several classes.  ...  (Reα, Imα)) with a region surrounding this point inside the variance.  ...  For example, devices could be produced by an eavesdropper that are 'self-testing.'  ... 
arXiv:1505.02792v1 fatcat:lljqs446nbbk5gnu2cmw3y3jr4

THE BALINESE TEMPER *

JANE BELO
1935 Journal of Personality  
how well-mannered, balanced, and relaxed they appear.  ...  The re- ligious concepts make the cause clear, and they supply, too, the remedy.  ... 
doi:10.1111/j.1467-6494.1935.tb02115.x fatcat:c6aabgu5izdandusbygohtjjz4

From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography [article]

Arash Atashpendar
2020 arXiv   pre-print
From the output produced by a memoryless deletion channel with a uniformly random input of known length n, one obtains a posterior distribution on the channel input.  ...  We relate deniability to fundamental concepts in quantum information theory and suggest a generic approach based on entanglement distillation for achieving information-theoretic deniability, followed by  ...  a session id and a role ∈ {initiator, responder}.  ... 
arXiv:2003.11663v1 fatcat:7ul4q6mupjcyzfyspus6xwh2ai

Computer and Information Science, Vol. 2, No. 4, November, 2009, Part B

Editor CIS
2009 Computer and Information Science  
., 2002, 3, pp.1-6) makes all nodes form a chain and specifies one node to communicate with BS directly.  ...  Each node only communicates with its neighbors and sends data to BS in turn, but it requires the location of all nodes.  ...  parameter in the case of relaxing the constraint conditions.  ... 
doi:10.5539/cis.v2n4p0b fatcat:czdrf2wi75avbiq7kbg27zeepi

Computer and Information Science, Vol. 2, No. 4, November, 2009, Part A

Editor CIS
2009 Computer and Information Science  
., 2002, 3, pp.1-6) makes all nodes form a chain and specifies one node to communicate with BS directly.  ...  Each node only communicates with its neighbors and sends data to BS in turn, but it requires the location of all nodes.  ...  parameter in the case of relaxing the constraint conditions.  ... 
doi:10.5539/cis.v2n4p0a fatcat:tgkgoy4mczfevkd42llwzxubl4

Enhancement of Hierarchy Cluster-Tree Routing for Wireless Sensor Network

Xuxing Ding, Fangfang Xie, Qing Wu
2009 Computer and Information Science  
., 2002, 3, pp.1-6) makes all nodes form a chain and specifies one node to communicate with BS directly.  ...  Each node only communicates with its neighbors and sends data to BS in turn, but it requires the location of all nodes.  ...  parameter in the case of relaxing the constraint conditions.  ... 
doi:10.5539/cis.v2n4p89 fatcat:nhc7jiwirrhstorva4xsgky4pa

Intrusion-Detection Systems [chapter]

Peng Ning, Sushil Jajodia
2012 Handbook of Computer Networks  
The series also serves as a forum for topics that may not have reached a level Researchers, as well as developers, are encouraged to contact Professor Sushil Jajodia with VULNERABILITY ANALYSIS  ...  The above assumption about bound varying delays can be relaxed with a bound on the difference between the delay of any two alerts with t max , while allowing the delay itself to be arbitrarily large (the  ...  On the other hand, the IDS based on anomaly and misuse detection technique are respectively self-calibrating or just calibrated.  ... 
doi:10.1002/9781118256107.ch26 fatcat:aeidzkegvfc27dqqmztiayv3dm
« Previous Showing results 1 — 15 out of 145 results