590 search results - page 101 / 118 » Resolution-stationary random number generators |
132
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
124
click to vote
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
137
click to vote
ICS
2010
Tsinghua U.
15 years 11 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
101
click to vote
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
138
click to vote
IAT
2009
IEEE
15 years 8 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....