1369 search results - page 29 / 274 » Lattice computations for random numbers |
150
click to vote
STOC
1997
ACM
15 years 10 months ago
1997
ACM
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
146
click to vote
CORR
2011
Springer
15 years 23 days ago
2011
Springer
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
152
click to vote
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
186
click to vote
LREC
2010
15 years 7 months ago
2010
Determining semantic relatedness between words or concepts is a fundamental process to many Natural Language Processing applications. Approaches for this task typically make use o...
159
click to vote
ISCIS
2005
Springer
15 years 11 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...