Sciweavers

1824 search results - page 220 / 365
» Estimating query performance using class predictions
Sort
View
ICS
2005
Tsinghua U.
14 years 3 months ago
What is worth learning from parallel workloads?: a user and session based analysis
Learning useful and predictable features from past workloads and exploiting them well is a major source of improvement in many operating system problems. We review known parallel ...
Julia Zilber, Ofer Amit, David Talby
ACG
2003
Springer
14 years 3 months ago
Opponent-Model Search in Bao: Conditions for a Successful Application
Abstract Opponent-Model search is a game-tree search method that explicitly uses knowledge of the opponent. There is some risk involved in using Opponent-Model search. Both the pre...
H. H. L. M. Donkers, H. Jaap van den Herik, Jos W....
INFOCOM
2008
IEEE
14 years 4 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff
VLDB
2007
ACM
119views Database» more  VLDB 2007»
14 years 10 months ago
Dynamic Workload Management for Very Large Data Warehouses: Juggling Feathers and Bowling Balls
Workload management for business intelligence (BI) queries poses different challenges than those addressed in the online transaction processing (OLTP) context. The fundamental pro...
Stefan Krompass, Umeshwar Dayal, Harumi A. Kuno, A...
ECCV
2000
Springer
14 years 2 months ago
Measuring the Self-Consistency of Stereo Algorithms
A new approach to characterizing the performance of point-correspondence algorithms is presented. Instead of relying on any \ground truth', it uses the self-consistency of th...
Yvan G. Leclerc, Quang-Tuan Luong, Pascal Fua