509 search results - page 71 / 102 » Lower Bounds for Approximation Algorithms for the Steiner Tr... |
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
IPL
2010
13 years 5 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
GI
2009
Springer
13 years 5 months ago
2009
Springer
: This paper describes the passive emitter localization using Time Difference of Arrival (TDOA) measurements. It investigates various methods for estimating the solution of this no...
SODA
2012
ACM
11 years 9 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...
ISAAC
2005
Springer
14 years 27 days ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...