2252 search results - page 111 / 451 » Lower Bounds for Dynamic Algorithms |
119
click to vote
BIBE
2005
IEEE
15 years 9 months ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
126
click to vote
STOC
1992
ACM
15 years 7 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
126
click to vote
UAI
2003
15 years 4 months ago
2003
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
118
click to vote
JCSS
2008
15 years 3 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
117
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In thi...