1787 search results - page 246 / 358 » Approximation Techniques for Spatial Data |
136
click to vote
NIPS
1996
15 years 3 months ago
1996
Dynamic Programming, Q-learning and other discrete Markov Decision Process solvers can be applied to continuous d-dimensional state-spaces by quantizing the state space into an arr...
150
Voted
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
129
click to vote
ESA
2008
Springer
15 years 4 months ago
2008
Springer
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
150
Voted
BIBE
2008
IEEE
15 years 9 months ago
2008
IEEE
— This paper describes a design and implementation of the Smith-Waterman algorithm accelerated on the graphics processing unit (GPU). Our method is implemented using compute uni...
146
Voted
ICDM
2010
IEEE
15 years 14 days ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...