Sciweavers

740 search results - page 40 / 148
» FAST Extended Release
Sort
View
IJCAI
2007
13 years 11 months ago
Fast Incremental Square Root Information Smoothing
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
Michael Kaess, Ananth Ranganathan, Frank Dellaert
UAI
2000
13 years 11 months ago
Fast Planning in Stochastic Games
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
Michael J. Kearns, Yishay Mansour, Satinder P. Sin...
SIGOPS
2008
104views more  SIGOPS 2008»
13 years 9 months ago
PipesFS: fast Linux I/O in the unix tradition
This paper presents PipesFS, an I/O architecture for Linux 2.6 that increases I/O throughput and adds support for heterogeneous parallel processors by (1) collapsing many I/O inte...
Willem de Bruijn, Herbert Bos
SMA
2008
ACM
396views Solid Modeling» more  SMA 2008»
13 years 9 months ago
Fast mesh segmentation using random walks
3D mesh models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Mesh segmentation is an impo...
Yu-Kun Lai, Shi-Min Hu, Ralph R. Martin, Paul L. R...
TIT
2008
103views more  TIT 2008»
13 years 9 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah