29908 search results - page 276 / 5982 » On the complexity of communication complexity |
166
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
184
click to vote
ADBIS
2000
Springer
15 years 11 months ago
2000
Springer
Data collected in many applications have a form of sequences of events. One of the popular data mining problems is discovery of frequently occurring episodes in such sequences. Eff...
161
click to vote
SMA
1997
ACM
15 years 10 months ago
1997
ACM
Much of recent research in representation schemes for solid modeling was focused on the extension of boundary representations to support non-manifold topologies. We introduce here...
187
click to vote
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
182
click to vote
ROBOCUP
2000
Springer
15 years 10 months ago
2000
Springer
In the RoboCup Rescue Simulation Project, several kinds of simulator such as Building-Collapse and Road-Blockage Simulator, Fire Spread Simulator and Tra c Flow Simulator are expec...