3708 search results - page 379 / 742 » Approximating Betweenness Centrality |
167
click to vote
ICAIL
2003
ACM
16 years 1 days ago
2003
ACM
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...
173
click to vote
SENSYS
2003
ACM
16 years 1 days ago
2003
ACM
We present a novel method for tracking the movement of people or vehicles in open outdoor environments using sensor networks. Unlike other sensor network-based methods, which depe...
203
click to vote
ECCV
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
190
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
181
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Q-learning is a technique used to compute an optimal policy for a controlled Markov chain based on observations of the system controlled using a non-optimal policy. It ...