Sciweavers

4325 search results - page 487 / 865
» Incremental computation with names
Sort
View
FLAIRS
2009
15 years 4 months ago
Dynamic Programming Approximations for Partially Observable Stochastic Games
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
Akshat Kumar, Shlomo Zilberstein
ICONIP
2009
15 years 4 months ago
Gender Classification Based on Support Vector Machine with Automatic Confidence
In this paper, we propose a support vector machine with automatic confidence (SVMAC) for gender classification based on facial images. Namely, we explore how to incorporate confide...
Zheng Ji, Bao-Liang Lu
IEICET
2010
123views more  IEICET 2010»
15 years 4 months ago
TOA UWB Positioning with Two Receivers Using Known Indoor Features
Ultra-Wideband is an attractive technology for short range positioning, especially indoors. However, for normal Time of Arrival (ToA) positioning, at least three receivers with unb...
Jan Kietlinski-Zaleski, Takaya Yamazato, Masaaki K...
DEBU
2010
135views more  DEBU 2010»
15 years 3 months ago
Trends in Storage Technologies
The high random and sequential I/O requirements of contemplated workloads could serve as impetus to move faster towards storage-class memory (SCM), a technology that will blur the...
Evangelos Eleftheriou, Robert Haas, Jens Jelitto, ...
CORR
2011
Springer
157views Education» more  CORR 2011»
15 years 1 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek