Sciweavers

2925 search results - page 32 / 585
» Information Complexity of Online Problems
Sort
View
137
Voted
IROS
2006
IEEE
132views Robotics» more  IROS 2006»
15 years 11 months ago
Theoretical Results on On-line Sensor Self-Calibration
— In this paper we derive theoretical results for the problem of on-line sensor calibration for a mobile robot. We consider the case of the odometry sensor. A first series of re...
Agostino Martinelli, Jan W. Weingarten, Roland Sie...
ICDE
1999
IEEE
143views Database» more  ICDE 1999»
16 years 7 months ago
Query Routing in Large-Scale Digital Library Systems
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. However, the inc...
Ling Liu
CIKM
2009
Springer
16 years 6 days ago
Online anonymity for personalized web services
To receive personalized web services, the user has to provide personal information and preferences, in addition to the query itself, to the web service. However, detailed personal...
Yabo Xu, Ke Wang, Guoliang Yang, Ada Wai-Chee Fu
255
Voted
WAOA
2010
Springer
275views Algorithms» more  WAOA 2010»
15 years 3 months ago
Online Ranking for Tournament Graphs
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
Claire Mathieu, Adrian Vladu
151
Voted
ALT
2010
Springer
15 years 7 months ago
Optimal Online Prediction in Adversarial Environments
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
Peter L. Bartlett