The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
An effective query optimizer finds a query plan that exploits the characteristics of the source data. In data integration, little is known in advance about sources' propertie...
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
We study the problem of maximizing the expected rate over a slowly fading channel with quantized channel state information at the transmitter (CSIT). This problem has been recentl...