Sciweavers

3333 search results - page 483 / 667
» Optimal Power-Down Strategies
Sort
View
ICML
2004
IEEE
16 years 8 months ago
Lookahead-based algorithms for anytime induction of decision trees
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, ...
Saher Esmeir, Shaul Markovitch
SIGMOD
2004
ACM
122views Database» more  SIGMOD 2004»
16 years 7 months ago
Adapting to Source Properties in Processing Data Integration Queries
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...
Zachary G. Ives, Alon Y. Halevy, Daniel S. Weld
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
16 years 7 months ago
Efficient Query Reformulation in Peer-Data Management Systems
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...
Igor Tatarinov, Alon Y. Halevy
PODS
2006
ACM
216views Database» more  PODS 2006»
16 years 7 months ago
Cache-oblivious string B-trees
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...
DCC
2007
IEEE
16 years 6 months ago
Transmission Over Slowly Fading Channels Using Unreliable Quantized Feedback
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...
Siavash Ekbatani, Farzad Etemadi, Hamid Jafarkhani