1996 search results - page 351 / 400 » Financial Theory 2 |
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
SAC
2010
ACM
15 years 6 months ago
2010
ACM
Biological scientists have made large amounts of data available on the Web, which can be accessed by canned or precomputed queries presented via web forms. To satisfy further info...
107
click to vote
EDBT
2010
ACM
15 years 6 months 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...
PERCOM
2009
ACM
15 years 6 months ago
2009
ACM
—Earlier sensor network MAC protocols focus on energy conservation in low-duty cycle applications, while some recent applications involve real-time high-data-rate signals. This m...
PODC
2009
ACM
15 years 6 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...