Filters








2,476 Hits in 2.3 sec

Bundle min-Hashing

Stefan Romberg, Rainer Lienhart
2013 International Journal of Multimedia Information Retrieval  
We present a feature bundling technique based on min-Hashing. Individual local features are aggregated with features from their spatial neighborhood into bundles.  ...  These bundles carry more visual information than single visual words. The recognition of logos in novel images is then performed by querying a database of reference images.  ...  Bundle min-Hashing We build our bundling technique on min-Hashing mainly for two reasons: (1) feature bundles can be naturally represented as sparse sets and (2) min-Hashing does not imply a strict ordering  ... 
doi:10.1007/s13735-013-0040-x fatcat:3jzzxkfvnjbizieidjusag2kyu

Bundle min-hashing for logo recognition

Stefan Romberg, Rainer Lienhart
2013 Proceedings of the 3rd ACM conference on International conference on multimedia retrieval - ICMR '13  
We present a scalable logo recognition technique based on feature bundling. Individual local features are aggregated with features from their spatial neighborhood into bundles.  ...  These bundles carry more information about the image content than single visual words. The recognition of logos in novel images is then performed by querying a database of reference images.  ...  BUNDLE MIN-HASHING We build our bundling technique on min-hashing mainly for two reasons: (1) Feature bundles can be naturally represented as sparse sets and (2) min-hashing does not imply a strict ordering  ... 
doi:10.1145/2461466.2461486 dblp:conf/mir/RombergL13 fatcat:tcio7g3mwfedrkq26l4fwgywmu

Robust Feature Bundling [chapter]

Stefan Romberg, Moritz August, Christian X. Ries, Rainer Lienhart
2012 Lecture Notes in Computer Science  
As in practice an exact search for such bundles is infeasible, we employ a robust approximate similarity search with min-hashing in order to retrieve images containing similar bundles.  ...  In this work we present a feature bundling technique that aggregates individual local features with features from their spatial neighborhood into bundles.  ...  Feature Bundles We build our bundling technique on min-hash mainly for two reasons: (1) Feature bundles can be naturally represented as sparse sets and (2) min-hash does not imply a strict ordering or  ... 
doi:10.1007/978-3-642-34778-8_5 fatcat:om2c6oqllfbwxpberdodsswibm

A Proactive DOS Filter Mechanism for Delay Tolerant Networks [chapter]

Godwin Ansa, Haitham Cruickshank, Zhili Sun
2011 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
It is then hashed using a one-way hash function H (SHA-256 algorithm) to produce a fixed-length hash value h. It is the hash value h that is appended to a bundle as DTN-cookie.  ...  The amount of effort needed for a brute-force on a MAC algorithm can be expressed as min (2 k , 2 n ).  ... 
doi:10.1007/978-3-642-23825-3_20 fatcat:dr4htt5uanb4rlwk4h56xigiiy

List of notions [chapter]

2021 Blockchain  
-blocks Confirmation A period of time (commonly around  min) necessary for adding six new blocks behind a solved block that contain some transaction.  ...  . % Attack A potential attack on a blockchain network, where a single entity or organization is able to control the majority of the hash power, potentially causing a network disruption.  ...  Branch Tip A tip that represents the last individual transaction in a branch tip bundle (see IOTA bundle).  ... 
doi:10.1515/9783110681130-204 fatcat:lwy24bd7nrgnhecslwhydbsuhy

Cryptanalysis of Curl-P and Other Attacks on the IOTA Cryptocurrency

Ethan Heilman, Neha Narula, Garrett Tanzer, James Lovejoy, Michael Colavita, Madars Virza, Tadge Dryja
2020 IACR Transactions on Symmetric Cryptology  
Finally, we show that in a chosen-message setting we could forge signatures and multi-signatures of valid spending transactions (called bundles in IOTA).  ...  We developed practical attacks on IOTA's cryptographic hash function Curl-P-27, allowing us to quickly generate short colliding messages. These collisions work even for messages of the same length.  ...  By doing this, Eve can produce two bundles with different values in the second transaction that have the same bundle hash.  ... 
doi:10.13154/tosc.v2020.i3.367-391 dblp:journals/tosc/HeilmanNTLCVD20 fatcat:4flxxmbivbf5pdbe5l4k5hck4q

Top multimedia information retrieval papers

Michael S. Lew
2016 International Journal of Multimedia Information Retrieval  
Bundle Min-Hashing Stefan Romberg, Rainer Lienhart http://link.springer.com/article/10.1007/s13735-013-0040-x "We present a feature bundling technique based on min-Hashing.  ...  Individual local features are aggregated with features from their spatial neighborhood into bundles. These bundles carry more visual information than single visual words".  ... 
doi:10.1007/s13735-016-0108-5 fatcat:leae5vvpxbeutjn4ovwj7qttyy

Conformational transitions of the sodium-dependent sugar transporter, vSGLT

Aviv Paz, Derek P. Claxton, Jay Prakash Kumar, Kelli Kazmier, Paola Bisignano, Shruti Sharma, Shannon A. Nolte, Terrin M. Liwag, Vinod Nayak, Ernest M. Wright, Michael Grabe, Hassane S. Mchaourab (+1 others)
2018 Proceedings of the National Academy of Sciences of the United States of America  
The "rocking-bundle" mechanism represents a minimalist solution to achieve alternating access by transitioning between outward-and inward-facing conformations through rigid-body motion of the bundle domain  ...  cornerstone of the 5TMIR topology is the spatial arrangement between the first two TMs (TM1-2 and TM6-7) and the last three TMs (TM3-5 and TM8-10), of each inverted repeat, frequently referred to as the "bundle  ...  Broken cells were subjected to a 35-min centrifugation at 15,000 × g and the clear supernatant was further spun down for 60 min at 302,000 × g to isolate membranes.  ... 
doi:10.1073/pnas.1718451115 pmid:29507231 pmcid:PMC5866573 fatcat:dvcdf7aiingejmwopvzp52kkuy

Systematic Support for Content Bundling in BitTorrent Swarming

Jinyoung Han, Taejoong Chung, Hyunchul Kim, Ted Taekyoung Kwon, Yanghee Choi
2010 2010 INFOCOM IEEE Conference on Computer Communications Workshops  
TABLE I : I Computation time of each algorithm Content Similarity cosine Levenshtein matching coefficient 70% 60 min 203 min 132 min 80% 115 min 256 min 204 min 90% 166 min 510 min 268 min  ...  ., movie, TV show or game), and content hash, we choose the torrent title because the torrent title is exactly what BitTorrent users use to search, download, and upload contents.  ... 
doi:10.1109/infcomw.2010.5466693 fatcat:qqkz6uyexnfjhop3vlxtjnh3ty

IOTA-BT: A P2P File-Sharing System Based on IOTA

Li-Yuan Hou, Tsung-Yi Tang, Tyng-Yeu Liang
2020 Electronics  
However, BT mainly relies on either a central tracker (tracker) or distributed hash table (DHT) for locating file seeders while it runs a risk of a single point of failure or cyber-attacks such as Sybil  ...  (2) Hash the address, value, tag, timestamp, currentIndex, lastIndex, and other information in all TXs through the sponge function to generate a bundle hash and fill the bundle hash into the TX. (3)  ...  The time interval of heartbeats was set as 3 min.  ... 
doi:10.3390/electronics9101610 fatcat:dp6luvx4ircnpdpijnk3za3i6m

SPN-Hash: Improving the Provable Resistance against Differential Collision Attacks [chapter]

Jiali Choy, Huihui Yap, Khoongming Khoo, Jian Guo, Thomas Peyrin, Axel Poschmann, Chik How Tan
2012 Lecture Notes in Computer Science  
We propose a new hash function design with variable hash output sizes of 128, 256, and 512 bits, that reduces this gap.  ...  At the same time, our hash function design is secure against pre-image, second pre-image and rebound attacks, and is faster than PKC-based hashes.  ...  β d = min v =0 {wt(v) + wt(L(v))}, where the wt(x) is the number of non-zero s-bit characters in x.  ... 
doi:10.1007/978-3-642-31410-0_17 fatcat:5cnw7mauyrhu7kqx4jk6hcnfye

A Subscribable Peer-to-Peer RDF Repository for Distributed Metadata Management

Min Cai, Martin Frank, Baoshi Yan, Robert MacGregor
2004 Social Science Research Network  
In this paper, we present a scalable Peer-to-Peer RDF repository, named RDF-Peers, which stores each triple in a multi-attribute addressable network by applying globally known hash functions.  ...  A simplistic locality preserving hash function we could use is H(v) = (v −v min )× (2 m − 1)/(v max − v min ), where v ∈ [v min , v max ].  ...  Thus, the routing hops for storing a bundle of attribute-value pairs is O(M log N ) for bundles with M attributes.  ... 
doi:10.2139/ssrn.3199169 fatcat:azwxxtncvzhd5ayexawt223a4y

A Fast Binary Splitting Approach to Non-Adaptive Group Testing [article]

Eric Price, Jonathan Scarlett
2020 arXiv   pre-print
While the most basic form of our algorithm requires Ω(n) storage, we also provide a low-storage variant based on hashing, with similar recovery guarantees.  ...  Hence, the total storage is O(k log n + S hash log n). log 2 n each, then a word-RAM model of computation only incurs O(1) time per bundle, or O(k log k) time overall.  ...  Due to the first step, the second step will never erroneously be performed on a bundle without defective items, nor on a bundle with multiple defective items.  ... 
arXiv:2006.10268v1 fatcat:6it2t3pxtbfvnlxfuwigumqxf4

Implementation of Micropayment System Using IoT Devices

Ryota Nakada, Kien Nguyen, Hiroo Sekiya
2021 Journal of Signal Processing  
The evaluation results show that the latency consumed by one micropayment is about 3 min in our system. Most of the latency is caused by the hash calculation to approve IOTA's new transaction.  ...  In IOTA, a group of transactions is named Bundle, which may consist of zero-value transactions. Bundle can contain either messages, signatures, or both.  ... 
doi:10.2299/jsp.25.137 fatcat:fncshsrjvvevnfl7otns27jj7a

A subscribable peer-to-peer RDF repository for distributed metadata management

M CAI, M FRANK, B YAN, R MACGREGOR
2004 Journal of Web Semantics  
In this paper, we present a scalable Peer-to-Peer RDF repository, named RDF-Peers, which stores each triple in a multi-attribute addressable network by applying globally known hash functions.  ...  A simplistic locality preserving hash function we could use is H(v) = (v −v min )× (2 m − 1)/(v max − v min ), where v ∈ [v min , v max ].  ...  Thus, the routing hops for storing a bundle of attribute-value pairs is O(M log N ) for bundles with M attributes.  ... 
doi:10.1016/j.websem.2004.10.003 fatcat:ychbch7lznehpgfvyg7s43odny
« Previous Showing results 1 — 15 out of 2,476 results