Sciweavers

1007 search results - page 15 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
COLT
1994
Springer
15 years 3 months ago
An Optimal Parallel Algorithm for Learning DFA
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
José L. Balcázar, Josep Díaz,...
88
Voted
CORR
2008
Springer
189views Education» more  CORR 2008»
14 years 11 months ago
Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli
GCC
2005
Springer
15 years 5 months ago
Query Optimization in Database Grid
DarGridⅡ is an implemented database gird system whose goal is to provide a semantic solution for integrating database resources on the web. Although many algorithms have been pro...
Xiaoqing Zheng, Huajun Chen, Zhaohui Wu, Yuxin Mao
87
Voted
IPPS
2006
IEEE
15 years 5 months ago
Cooperative checkpointing theory
Cooperative checkpointing uses global knowledge of the state and health of the machine to improve performance and reliability by dynamically deciding when to skip checkpoint reque...
Adam J. Oliner, Larry Rudolph, Ramendra K. Sahoo
82
Voted
CORR
2011
Springer
149views Education» more  CORR 2011»
14 years 6 months ago
Load-Balancing Spatially Located Computations using Rectangular Partitions
Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (repres...
Erik Saule, Erdeniz Ö. Bas, Ümit V. &Cce...