Sciweavers

5448 search results - page 214 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
ICDAR
2003
IEEE
15 years 9 months ago
A Low-Cost Parallel K-Means VQ Algorithm Using Cluster Computing
In this paper we propose a parallel approach for the Kmeans Vector Quantization (VQ) algorithm used in a twostage Hidden Markov Model (HMM)-based system for recognizing handwritte...
Alceu de Souza Britto Jr., Paulo Sergio Lopes de S...
COMPSAC
2005
IEEE
15 years 6 months ago
A Low-Latency Checkpointing Scheme for Mobile Computing Systems
Fault-tolerant mobile computing systems have different requirements and restrictions, not taken into account by conventional distributed systems. This paper presents a coordinate...
Guohui Li, LihChyun Shu
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
15 years 10 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
EUSFLAT
2001
127views Fuzzy Logic» more  EUSFLAT 2001»
15 years 5 months ago
Soft computing in investment appraisal
Standard financial techniques neglect extreme situations and regards large market shifts as too unlikely to matter. Such approach accounts for what occurs most of the time in the ...
Antoaneta Serguieva, John Hunter, Tatiana Kalganov...
FLAIRS
2007
15 years 6 months ago
Annotation of Children's Oral Narrations: Modeling Emergent Narrative Skills for Computational Applications
We present an annotation method for developing a model of children’s comprehension that differentiates between their recall for the objective content of a story and inferred con...
Rebecca J. Passonneau, Adam Goodkind, Elena T. Lev...