Sciweavers

3270 search results - page 641 / 654
» Approximate String Processing
Sort
View
JMLR
2008
129views more  JMLR 2008»
15 years 14 days ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
92
Voted
MANSCI
2008
96views more  MANSCI 2008»
15 years 14 days ago
Staffing of Time-Varying Queues to Achieve Time-Stable Performance
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
Zohar Feldman, Avishai Mandelbaum, William A. Mass...
ENTCS
2007
116views more  ENTCS 2007»
15 years 14 days ago
Experiments in Cost Analysis of Java Bytecode
Recently, we proposed a general framework for the cost analysis of Java bytecode which can be used for measuring resource usage. This analysis generates, at compile-time, cost rel...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
107
Voted
PAMI
2006
132views more  PAMI 2006»
15 years 13 days ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
15 years 12 days ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...