123 search results - page 15 / 25 » Complexity of Boolean Functions on PRAMs - Lower Bound Techn... |
111
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
153
click to vote
VLSID
2010
IEEE
14 years 11 months ago
2010
IEEE
Directed test generation is important for the functional verification of complex system-on-chip designs. SAT based bounded model checking is promising for counterexample generatio...
COLT
1999
Springer
15 years 5 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
114
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
131
click to vote
ECRTS
2002
IEEE
2002
IEEE
Managing Multi-Mode Tasks with Time Cost and Quality Levels using Optimal Discrete Control Synthesis
15 years 6 months ago
Real-time control systems are complex to design, and automation support is important. We are interested in systems with multiple tasks, each with multiple modes, implementing a fu...