Sciweavers

2421 search results - page 94 / 485
» Message from the Editor-in-Chief
Sort
View
ICIP
2008
IEEE
14 years 4 months ago
On the security of non-forgeable robust hash functions
In many applications, it is often desirable to extract a consistent key from a multimedia object (e.g., an image), even when the object has gone through a noisy channel. For examp...
Qiming Li, Sujoy Roy
ADHOCNOW
2008
Springer
13 years 11 months ago
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
Jean-Claude Bermond, Min-Li Yu
AHSWN
2010
105views more  AHSWN 2010»
13 years 10 months ago
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
Jean-Claude Bermond, Min-Li Yu
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 10 months ago
Mining social networks for personalized email prioritization
Email is one of the most prevalent communication tools today, and solving the email overload problem is pressingly urgent. A good way to alleviate email overload is to automatical...
Shinjae Yoo, Yiming Yang, Frank Lin, Il-Chul Moon
WWW
2010
ACM
14 years 5 months ago
New-web search with microblog annotations
Web search engines discover indexable documents by recursively ‘crawling’ from a seed URL. Their rankings take into account link popularity. While this works well, it introduc...
Tom Rowlands, David Hawking, Ramesh Sankaranarayan...