Sciweavers

7015 search results - page 214 / 1403
» Approximation algorithms for co-clustering
Sort
View
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
16 years 18 days ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
SPIRE
2005
Springer
15 years 12 months ago
Restricted Transposition Invariant Approximate String Matching Under Edit Distance
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
Heikki Hyyrö
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 10 months ago
Approximating Average Parameters of Graphs
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
Oded Goldreich, Dana Ron
EOR
2007
117views more  EOR 2007»
15 years 6 months ago
Simultaneous perturbation stochastic approximation of nonsmooth functions
A simultaneous perturbation stochastic approximation (SPSA) method has been developed in this paper, using the operators of perturbation with the Lipschitz density function. This ...
Vaida Bartkute, Leonidas Sakalauskas
CVPR
2004
IEEE
16 years 8 months ago
Incremental Density Approximation and Kernel-Based Bayesian Filtering for Object Tracking
Statistical density estimation techniques are used in many computer vision applications such as object tracking, background subtraction, motion estimation and segmentation. The pa...
Bohyung Han, Dorin Comaniciu, Ying Zhu, Larry S. D...