Sciweavers

3708 search results - page 109 / 742
» Approximating Betweenness Centrality
Sort
View
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
14 years 7 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
136
Voted
CVPR
1997
IEEE
16 years 2 months ago
Efficient Approximation of Range Images Through Data-Dependent Adaptive Triangulations
This paper presents an efficient algorithm for generating adaptive triangular meshes from dense range images. The proposed technique consists of two stages. First, a quadrilateral...
Miguel Angel García, Angel Domingo Sappa, L...
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 2 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
VLDB
2007
ACM
107views Database» more  VLDB 2007»
16 years 27 days ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
16 years 25 days ago
Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
Naga K. Govindaraju, Nikunj Raghuvanshi, Dinesh Ma...