13706 search results - page 81 / 2742 » Information Problems in Information Society |
206
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
170
click to vote
PKC
2010
Springer
15 years 10 months ago
2010
Springer
A fundamental privacy problem in the client-server setting is the retrieval of a record from a database maintained by a server so that the computationally bounded server remains ob...
230
click to vote
AAAI
2011
14 years 6 months ago
2011
In this paper, we propose a novel method to select the most informative subset of features, which has little redundancy and very strong discriminating power. Our proposed approach...
179
click to vote
EUROSSC
2006
Springer
15 years 10 months ago
2006
Springer
As we gain access to increasing volumes of context data, we face the problem of moving this information from the sensors that produce it to the applications that consume it. Our ap...
196
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...