6050 search results - page 350 / 1210 » Information In The Non-Stationary Case |
210
click to vote
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
187
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such Named Graphs. This enables RDF statements that desc...
190
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
Modern techniques for distributed information retrieval use a set of documents sampled from each server, but these samples have been underutilised in server selection. We describe...
177
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper we obtain information theoretical conditions for tracking in linear time-invariant control systems. We consider the particular case where the closed loop contains...
175
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In contrast to the traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, new generation of information processing applicatio...