Sciweavers

12193 search results - page 74 / 2439
» It's not all about
Sort
View
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
15 years 1 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
CORR
2007
Springer
94views Education» more  CORR 2007»
14 years 11 months ago
Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels
— This paper studies a variant of the classical problem of “writing on dirty paper” in which the sum of the input and the interference, or dirt, is multiplied by a random var...
Wenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Lan...
NN
2006
Springer
127views Neural Networks» more  NN 2006»
14 years 11 months ago
The asymptotic equipartition property in reinforcement learning and its relation to return maximization
We discuss an important property called the asymptotic equipartition property on empirical sequences in reinforcement learning. This states that the typical set of empirical seque...
Kazunori Iwata, Kazushi Ikeda, Hideaki Sakai
SYNTHESE
2008
73views more  SYNTHESE 2008»
14 years 11 months ago
It's in your nature: a pluralistic folk psychology
I suggest a pluralistic account of folk psychology according to which not all predictions or explanations rely on the attribution of mental states, and not all intentional actions ...
Kristin Andrews
JCT
2010
127views more  JCT 2010»
14 years 6 months ago
On the density of a graph and its blowup
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
Asaf Shapira, Raphael Yuster