1084 search results - page 5 / 217 » Airhockey over a distance |
SODA
2010
ACM
13 years 5 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
TCOM
2008
13 years 5 months ago
2008
In this paper, a method to design regular (2, dc)-LDPC codes over GF(q) with both good waterfall and error floor properties is presented, based on the algebraic properties of thei...
PRICAI
2010
Springer
13 years 5 months ago
2010
Springer
This paper studies the problem of multi-agent planning in the environment where agents may need to cooperate in order to achieve their individual goals but they do so only if the c...
JALC
2002
13 years 7 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
ACL
2009
13 years 5 months ago
2009
Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...