Sciweavers

10392 search results - page 2003 / 2079
» Introduction to Computer Science
Sort
View
BTW
2009
Springer
153views Database» more  BTW 2009»
15 years 7 months ago
Formalizing ETL Jobs for Incremental Loading of Data Warehouses
Abstract: Extract-transform-load (ETL) tools are primarily designed for data warehouse loading, i.e. to perform physical data integration. When the operational data sources happen ...
Thomas Jörg, Stefan Deßloch
BTW
2009
Springer
114views Database» more  BTW 2009»
15 years 7 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
111
Voted
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
15 years 7 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»
15 years 7 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
85
Voted
COCO
2009
Springer
78views Algorithms» more  COCO 2009»
15 years 7 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
« Prev « First page 2003 / 2079 Last » Next »