Sciweavers

318 search results - page 13 / 64
» Approximating Difference Evaluations with Local Information
Sort
View
CIKM
2010
Springer
14 years 10 months ago
Online stratified sampling: evaluating classifiers at web-scale
Deploying a classifier to large-scale systems such as the web requires careful feature design and performance evaluation. Evaluation is particularly challenging because these larg...
Paul N. Bennett, Vitor R. Carvalho
136
Voted
DSN
2011
IEEE
14 years 6 days ago
Approximate analysis of blocking queueing networks with temporal dependence
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
Vittoria de Nitto Persone, Giuliano Casale, Evgeni...
106
Voted
JAIR
2006
160views more  JAIR 2006»
15 years 11 days ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
107
Voted
GI
2009
Springer
14 years 10 months ago
An Improved Method for creating Shared Belief in Communication Constrained Sensor Networks
: Networked systems that gather sensor data in order to react to phenomena in their surroundings are faced with a growing need for adaptive behavior to operate in dynamically chang...
Eelke van Foeken, Peter Hiemstra, Leon Kester
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
14 years 10 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen