Sciweavers

7015 search results - page 375 / 1403
» Approximation algorithms for co-clustering
Sort
View
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
15 years 1 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
CVPR
1997
IEEE
16 years 8 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...
CVPR
2008
IEEE
16 years 8 months ago
Approximate earth mover's distance in linear time
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
Sameer Shirdhonkar, David W. Jacobs
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
16 years 8 months ago
TALE: A Tool for Approximate Large Graph Matching
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
Yuanyuan Tian, Jignesh M. Patel
SIGMOD
2003
ACM
161views Database» more  SIGMOD 2003»
16 years 7 months ago
Approximate Join Processing Over Data Streams
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald