Sciweavers

333 search results - page 44 / 67
» Speeding up moving-target search
Sort
View
CN
2007
137views more  CN 2007»
14 years 10 months ago
Georoy: A location-aware enhancement to Viceroy peer-to-peer algorithm
The success of experiences such as Seattle and Houston Wireless has attracted the attention on the so called wireless mesh community networks. These are wireless multihop networks...
Laura Galluccio, Giacomo Morabito, Sergio Palazzo,...
89
Voted
AI
2005
Springer
14 years 10 months ago
Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
Richard J. Wallace, Eugene C. Freuder
JCST
2007
97views more  JCST 2007»
14 years 10 months ago
Improved Collision Attack on Hash Function MD5
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that ...
Jie Liang, Xue-Jia Lai
CIKM
2010
Springer
14 years 8 months ago
Fast query expansion using approximations of relevance models
Pseudo-relevance feedback (PRF) improves search quality by expanding the query using terms from high-ranking documents from an initial retrieval. Although PRF can often result in ...
Marc-Allen Cartright, James Allan, Victor Lavrenko...
IEEECIT
2010
IEEE
14 years 8 months ago
A Rotate-based Best Neighborhood Matching Algorithm for High Definition Image Error Concealment
—Error concealment restores the visual integrity of image content that has been damaged due to a bad network transmission. Best neighborhood matching (BNM) is an effective image ...
Liqiang He, Yanyan Zhang