Sciweavers

2783 search results - page 506 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
ICS
2005
Tsinghua U.
15 years 6 months ago
The implications of working set analysis on supercomputing memory hierarchy design
Supercomputer architects strive to maximize the performance of scientific applications. Unfortunately, the large, unwieldy nature of most scientific applications has lead to the...
Richard C. Murphy, Arun Rodrigues, Peter M. Kogge,...
ILP
2005
Springer
15 years 6 months ago
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
Yi-Dong Shen, Qiang Yang
ISRR
2005
Springer
118views Robotics» more  ISRR 2005»
15 years 6 months ago
A Provably Consistent Method for Imposing Sparsity in Feature-Based SLAM Information Filters
An open problem in Simultaneous Localization and Mapping (SLAM) is the development of algorithms which scale with the size of the environment. A few promising methods exploit the ...
Matthew Walter, Ryan Eustice, John J. Leonard
LCPC
2005
Springer
15 years 6 months ago
Supporting SELL for High-Performance Computing
We briefly introduce the notion of Semantically Enhanced Library Languages, SELL, as a practical and economical alternative to special-purpose programming languages for high-perfo...
Bjarne Stroustrup, Gabriel Dos Reis
WEBDB
2005
Springer
100views Database» more  WEBDB 2005»
15 years 6 months ago
Malleable Schemas: A Preliminary Report
Large-scale information integration, and in particular, search on the World Wide Web, is pushing the limits on the combination of structured data and unstructured data. By its ver...
Xin Dong, Alon Y. Halevy