218 search results - page 34 / 44 » Constant Rate Approximate Maximum Margin Algorithms |
TSP
2011
13 years 2 months ago
2011
—Detection of the number of sinusoids embedded in noise is a fundamental problem in statistical signal processing. Most parametric methods minimize the sum of a data fit (likeli...
JCC
2006
13 years 7 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—Layered streaming is an effective solution to address the receiver heterogeneity in peer-to-peer (P2P) multimedia distribution. This paper targets a fundamental challenge in thi...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
SRDS
1999
IEEE
13 years 12 months ago
1999
IEEE
Numerous mathematical approaches have been proposed to determine the optimal checkpoint interval for minimizing total execution time of an application in the presence of failures....