Sciweavers

340 search results - page 4 / 68
» ets 2009
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 5 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
JMLR
2010
93views more  JMLR 2010»
13 years 5 months ago
Erratum: SGDQN is Less Careful than Expected
The SGD-QN algorithm described in (Bordes et al., 2009) contains a subtle flaw that prevents it from reaching its design goals. Yet the flawed SGD-QN algorithm has worked well eno...
Antoine Bordes, Léon Bottou, Patrick Gallin...
AAAI
2010
14 years 10 days ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
ACL
2010
13 years 9 months ago
Incorporating Extra-Linguistic Information into Reference Resolution in Collaborative Task Dialogue
This paper proposes an approach to reference resolution in situated dialogues by exploiting extra-linguistic information. Recently, investigations of referential behaviours involv...
Ryu Iida, Syumpei Kobayashi, Takenobu Tokunaga
CAGD
2010
132views more  CAGD 2010»
13 years 7 months ago
Skinning of circles and spheres
Skinning of an ordered set of discrete circles is discussed in this paper. By skinning we mean the geometric construction of two G1 continuous curves touching each of the circles ...
R. Kunkli, M. Hoffmann