Sciweavers

4860 search results - page 960 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
IPPS
2000
IEEE
13 years 12 months ago
Run-Time Support for Adaptive Load Balancing
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
Milind A. Bhandarkar, Robert Brunner, Laxmikant V....
AI
2000
Springer
13 years 12 months ago
Keep It Simple: A Case-Base Maintenance Policy Based on Clustering and Information Theory
Abstract. Today’s case based reasoning applications face several challenges. In a typical application, the case bases grow at a very fast rate and their contents become increasin...
Qiang Yang, Jing Wu
FOCS
1999
IEEE
13 years 11 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
SIGMOD
1999
ACM
108views Database» more  SIGMOD 1999»
13 years 11 months ago
DynaMat: A Dynamic View Management System for Data Warehouses
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
Yannis Kotidis, Nick Roussopoulos
ICRA
1999
IEEE
114views Robotics» more  ICRA 1999»
13 years 11 months ago
Smoother Based 3-D Attitude Estimation for Mobile Robot Localization
The mobile robot localization problem is decomposed into two stages attitude estimation followed by position estimation. The innovation of our method is the use of a smoother, in ...
Stergios I. Roumeliotis, Gaurav S. Sukhatme, Georg...