303 search results - page 34 / 61 » Discrete Mathematics for Computer Science, Some Notes |
259
click to vote
GIS
2006
ACM
16 years 3 months ago
2006
ACM
If you were told that some object A was perfectly (or somewhat, or not at all) in some direction (e.g., west, above-right) of some reference object B, where in space would you loo...
107
Voted
ALGORITHMICA
2005
15 years 2 months ago
2005
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
89
Voted
WWW
2006
ACM
16 years 3 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
104
Voted
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
Abstract The LLL algorithm aims at finding a “reduced” basis of a Euclidean lattice. The LLL algorithm plays a primary role in many areas of mathematics and computer science. ...
132
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...