712 search results - page 102 / 143 » The Complexity of Constructing Evolutionary Trees Using Expe... |
CVPR
2007
IEEE
16 years 7 days ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
ADBIS
2007
Springer
15 years 4 months ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
IPTPS
2003
Springer
15 years 3 months ago
2003
Springer
In a peer-to-peer file-sharing system, a client desiring a particular file must choose a source from which to download. The problem of selecting a good data source is difficult...
92
Voted
ICDCS
2010
IEEE
15 years 2 months ago
2010
IEEE
—Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algo...
93
Voted
SIAMCOMP
2002
14 years 10 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...