Sciweavers

6365 search results - page 337 / 1273
» Fast Local Computation Algorithms
Sort
View
AMC
2007
134views more  AMC 2007»
15 years 6 months ago
An image fragile watermark scheme based on chaotic image pattern and pixel-pairs
Fragile watermarking techniques for digital content have been studied in the past few years. Fragile watermarks are used to determine if a piece of watermarked digital content has...
Shaohui Liu, Hongxun Yao, Wen Gao, Yongliang Liu
IJCV
2006
83views more  IJCV 2006»
15 years 6 months ago
Visual Acuity in Day for Night
In film production, it is sometimes not convenient or directly impossible to shoot some night scenes at night. The film budget, schedule or location may not allow it. In these cas...
Gloria Haro, Marcelo Bertalmío, Vicent Case...
ADMA
2010
Springer
271views Data Mining» more  ADMA 2010»
15 years 1 months ago
Exploiting Concept Clumping for Efficient Incremental E-Mail Categorization
We introduce a novel approach to incremental e-mail categorization based on identifying and exploiting "clumps" of messages that are classified similarly. Clumping reflec...
Alfred Krzywicki, Wayne Wobcke
ICC
2009
IEEE
144views Communications» more  ICC 2009»
16 years 1 months ago
Analysis, Insights and Generalization of a Fast Decentralized Relay Selection Mechanism
Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays an...
Virag Shah, Neelesh B. Mehta, Raymond Yim
WABI
2009
Springer
132views Bioinformatics» more  WABI 2009»
16 years 1 months ago
mpscan: Fast Localisation of Multiple Reads in Genomes
Abstract. With Next Generation Sequencers, sequence based transcriptomic or epigenomic assays yield millions of short sequence reads that need to be mapped back on a reference geno...
Eric Rivals, Leena Salmela, Petteri Kiiskinen, Pet...