3907 search results - page 360 / 782 » Time, Knowledge, and Choice |
254
click to vote
JMLR
2012
13 years 9 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
164
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
C-SPARQL is an extension of SPARQL to support continuous queries over RDF data streams. Supporting streams in RDF format guarantees interoperability and opens up important applica...
174
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
We present a closed set data mining paradigm which is particularly e ective for uncovering the kind of deterministic, causal dependencies that characterize much of basic science. ...
140
click to vote
ATVA
2009
Springer
16 years 1 months ago
2009
Springer
We present a data symmetry reduction approach for model temporal-epistemic logic. The technique abstracts the epistemic indistinguishably relation for the knowledge operators, and ...
212
click to vote
ENC
2008
IEEE
16 years 1 months ago
2008
IEEE
In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable fr...