1369 search results - page 24 / 274 » Lattice computations for random numbers |
ICFCA
2009
Springer
14 years 3 months ago
2009
Springer
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
PODC
2004
ACM
14 years 2 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
BMCBI
2007
13 years 9 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
283
click to vote
Lecture Notes
Easy to follow lecture notes on Computational Physics.
CORR
2007
Springer
13 years 8 months ago
2007
Springer
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...