Sciweavers

11016 search results - page 2128 / 2204
» Cloud Computing for Science
Sort
View
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
14 years 4 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 4 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
COCO
2009
Springer
78views Algorithms» more  COCO 2009»
14 years 4 months ago
Fixed-Polynomial Size Circuit Bounds
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
Lance Fortnow, Rahul Santhanam, Ryan Williams
ECSQARU
2009
Springer
14 years 4 months ago
Merging Belief Bases Represented by Logic Programs
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
Julien Hué, Odile Papini, Eric Würbel
ERSHOV
2009
Springer
14 years 4 months ago
Multi-level Virtual Machine Debugging Using the Java Platform Debugger Architecture
Abstract. Debugging virtual machines (VMs) presents unique challenges, especially meta-circular VMs, which are written in the same language they implement. Making sense of runtime ...
Thomas Würthinger, Michael L. Van De Vanter, ...
« Prev « First page 2128 / 2204 Last » Next »