Sciweavers

705 search results - page 44 / 141
» Approximating Extended Answer Sets
Sort
View
ICRA
2008
IEEE
113views Robotics» more  ICRA 2008»
15 years 4 months ago
Reinforcement learning with function approximation for cooperative navigation tasks
— In this paper, we propose a reinforcement learning approach to address multi-robot cooperative navigation tasks in infinite settings. We propose an algorithm to simultaneously...
Francisco S. Melo, M. Isabel Ribeiro
GLOBE
2009
Springer
15 years 2 months ago
Designing, Specifying and Querying Metadata for Virtual Data Integration Systems
Abstract. We show how to specify and use the metadata for a virtual and relational data integration system under the local-as-view (LAV) approach. We use XML and RuleML for represe...
Leopoldo E. Bertossi, Gayathri Jayaraman
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 18 days ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 7 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
14 years 11 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount