Sciweavers

3894 search results - page 346 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
CIS
2004
Springer
15 years 11 months ago
Algorithms for Loosely Constrained Multiple Sequence Alignment
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
Bin Song, Fengfeng Zhou, Guoliang Chen
179
Voted
ADC
2003
Springer
94views Database» more  ADC 2003»
15 years 11 months ago
Multi-resolution Algorithms for Building Spatial Histograms
Selectivity estimation of queries not only provides useful information to the query processing optimization but also may give users a preview of processing results. In this paper,...
Qing Liu, Yidong Yuan, Xuemin Lin
137
Voted
ICS
1989
Tsinghua U.
15 years 10 months ago
Convergence rate and termination of asynchronous iterative algorithms
We consider iterative algorithms of the form z := f(z), executed by a parallel or distributed computing system. We focus on asynchronous implementations whereby each processor ite...
Dimitri P. Bertsekas, John N. Tsitsiklis
JMLR
2008
133views more  JMLR 2008»
15 years 6 months ago
Algorithms for Sparse Linear Classifiers in the Massive Data Setting
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
Suhrid Balakrishnan, David Madigan
188
Voted
JMLR
2008
159views more  JMLR 2008»
15 years 6 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin