Sciweavers

10271 search results - page 1949 / 2055
» Computer Science
Sort
View
103
Voted
BTW
2009
Springer
114views Database» more  BTW 2009»
15 years 9 months ago
Value Demonstration of Embedded Analytics for Front Office Applications
: Users of front office applications such as call center or customer support applications make millions and millions of decisions each day without analytical support. For example, ...
Erik Nijkamp, Martin Oberhofer, Albert Maier
128
Voted
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
15 years 9 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
152
Voted
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
15 years 9 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
102
Voted
COCO
2009
Springer
78views Algorithms» more  COCO 2009»
15 years 9 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
124
Voted
ECSQARU
2009
Springer
15 years 9 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
« Prev « First page 1949 / 2055 Last » Next »