2095 search results - page 18 / 419 » Improved pebbling bounds |
73
Voted
MOBIHOC
2009
ACM
16 years 9 days ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
COCOA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
EUROPAR
2004
Springer
15 years 5 months ago
2004
Springer
Address correlation is a technique that links the addresses that reference the same data values. Using a detailed source-code level analysis, a recent study [1] revealed that diffe...
69
Voted
IJCAI
2007
15 years 1 months ago
2007
Accurate entity resolution is sometimes impossible simply due to insufficient information. For example, in research paper author name resolution, even clever use of venue, title ...
103
click to vote
EUROCRYPT
2012
Springer
13 years 2 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...