619 search results - page 55 / 124 » Random Bichromatic Matchings |
IWCMC
2006
ACM
14 years 2 months ago
2006
ACM
— In this paper we focus on characterizing the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with station...
ERCIMDL
2010
Springer
13 years 10 months ago
2010
Springer
Abstract Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In t...
ISCAS
2005
IEEE
14 years 2 months ago
2005
IEEE
— A computation-aware motion estimation algorithm is proposed in this paper. Its goal is to find the best block matching results in a computation-limited and computation-variant...
ASUNAM
2010
IEEE
13 years 10 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
CRYPTO
2005
Springer
14 years 2 months ago
2005
Springer
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...