2925 search results - page 26 / 585 » Information Complexity of Online Problems |
BCSHCI
2007
15 years 3 months ago
2007
An experimental validation is presented of a novel method for usability testing that entails the playback of dynamic eyetracking data to cue the elicitation of retrospective verba...
84
Voted
ECIR
2003
Springer
15 years 3 months ago
2003
Springer
Current online stores suffer from a cardinal problem. There are too many products to offer, and customers find themselves lost due to the vast selection. As opposed to traditional ...
132
click to vote
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
98
Voted
TON
2008
15 years 1 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
118
click to vote
ISI
2006
Springer
15 years 1 months ago
2006
Springer
Since privacy information can be inferred via social relations, the privacy confidentiality problem becomes increasingly challenging as online social network services are more popu...