Sciweavers

13987 search results - page 375 / 2798
» The Two Guards Problem
Sort
View
AAAI
2004
15 years 8 months ago
On the Integration of Grounding Language and Learning Objects
This paper presents a multimodal learning system that can ground spoken names of objects in their physical referents and learn to recognize those objects simultaneously from natur...
Chen Yu, Dana H. Ballard
FAW
2010
Springer
225views Algorithms» more  FAW 2010»
15 years 7 months ago
Computing Minimum Diameter Color-Spanning Sets
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
Rudolf Fleischer, Xiaoming Xu
ALGORITHMICA
2010
75views more  ALGORITHMICA 2010»
15 years 7 months ago
In-Place Algorithms for Computing (Layers of) Maxima
We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal O(n log n) time and oc...
Henrik Blunck, Jan Vahrenhold
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 7 months ago
Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
Ilias Diakonikolas, Ryan O'Donnell, Rocco A. Serve...
DM
2006
76views more  DM 2006»
15 years 6 months ago
Lex M versus MCS-M
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...
Yngve Villanger