1242 search results - page 237 / 249 » A Computational Complexity Theory in Membrane Computing |
159
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
178
click to vote
MOBIHOC
2008
ACM
16 years 5 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...
182
click to vote
EDBT
2010
ACM
16 years 24 days ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
175
click to vote
INFOCOM
2009
IEEE
16 years 18 days ago
2009
IEEE
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...
142
click to vote
GECCO
2009
Springer
16 years 16 days ago
2009
Springer
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and em...