Sciweavers

5595 search results - page 774 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ADBIS
2000
Springer
91views Database» more  ADBIS 2000»
15 years 10 months ago
Efficient Region Query Processing by Optimal Page Ordering
A number of algorithms of clustering spatial data for reducing the number of disk seeks required to process spatial queries have been developed. One of the algorithms is the scheme...
Daesoo Cho, Bonghee Hong
EMNLP
2008
15 years 8 months ago
Acquiring Domain-Specific Dialog Information from Task-Oriented Human-Human Interaction through an Unsupervised Learning
We describe an approach for acquiring the domain-specific dialog knowledge required to configure a task-oriented dialog system that uses human-human interaction data. The key aspe...
Ananlada Chotimongkol, Alexander I. Rudnicky
ATAL
2010
Springer
15 years 7 months ago
Learning multirobot joint action plans from simultaneous task execution demonstrations
The central problem of designing intelligent robot systems which learn by demonstrations of desired behaviour has been largely studied within the field of robotics. Numerous archi...
Murilo Fernandes Martins, Yiannis Demiris
JFR
2010
119views more  JFR 2010»
15 years 1 months ago
Unsupervised classification of dynamic obstacles in urban environments
This paper presents a solution to the problem of unsupervised classification of dynamic obstacles in urban environments. A track-based model is introduced for the integration of 2...
Roman Katz, Juan Nieto, Eduardo Mario Nebot
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 7 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang