3875 search results - page 368 / 775 » Approximation algorithms for the 0-extension problem |
191
click to vote
CIMAGING
2010
15 years 8 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
163
click to vote
JMLR
2008
15 years 6 months ago
2008
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
174
click to vote
CIS
2004
Springer
16 years 7 days ago
2004
Springer
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...
197
click to vote
ADC
2003
Springer
16 years 2 days ago
2003
Springer
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,...
156
click to vote
ICS
1989
Tsinghua U.
15 years 11 months ago
1989
Tsinghua U.
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...