Sciweavers

2498 search results - page 390 / 500
» Data Structures with Unpredictable Timing
Sort
View
TON
2002
175views more  TON 2002»
15 years 2 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
CACM
2010
161views more  CACM 2010»
15 years 24 days ago
Efficiently searching for similar images
As it becomes increasingly viable to capture, store, and share large amounts of image and video data, automatic image analysis is crucial to managing visual information. Many prob...
Kristen Grauman
TSP
2010
14 years 9 months ago
Multichannel fast QR-decomposition algorithms: weight extraction method and its applications
Abstract--Multichannel fast QR decomposition RLS (MCFQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The main limitation is...
Mobien Shoaib, Stefan Werner, José Antonio ...
ACL
2011
14 years 6 months ago
Knowledge-Based Weak Supervision for Information Extraction of Overlapping Relations
Information extraction (IE) holds the promise of generating a large-scale knowledge base from the Web’s natural language text. Knowledge-based weak supervision, using structured...
Raphael Hoffmann, Congle Zhang, Xiao Ling, Luke S....
ISCAS
2011
IEEE
342views Hardware» more  ISCAS 2011»
14 years 5 months ago
Parallel Dynamic Voltage and Frequency Scaling for stream decoding using a multicore embedded system
—Parallel structures may be used to increase a system processing speed in case of large amount of data or highly complex calculations. Dynamic Voltage and Frequency Scaling (DVFS...
Ying-Xun Lai, Yueh-Min Huang, Chin-Feng Lai, Ljilj...