1632 search results - page 140 / 327 » Sublinear Time Algorithms for Metric Space Problems |
137
click to vote
CCCG
2007
15 years 5 months ago
2007
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
147
click to vote
ICANN
2009
Springer
15 years 8 months ago
2009
Springer
Recurrent neural networks serve as black-box models for nonlinear dynamical systems identification and time series prediction. Training of recurrent networks typically minimizes t...
122
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
112
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
145
click to vote
HIPC
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...