16093 search results - page 2774 / 3219 » On the optimality of the neighbor-joining algorithm |
250
click to vote
CN
2011
14 years 10 months ago
2011
Standard slow start does not work well under large bandwidthdelay product (BDP) networks. We find two causes of this problem in existing three popular operating systems, Linux, F...
213
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
253
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
205
click to vote
CVPR
2006
IEEE
16 years 9 months ago
2006
IEEE
In this paper, we propose a novel and robust algorithm for the groupwise non-rigid registration of multiple unlabeled point-sets with no bias toward any of the given pointsets. To...
181
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
We investigate the problem of finding the metric structure of a general 3D scene viewed by a moving camera with square pixels and constant unknown focal length. While the problem ...