16430 search results - page 394 / 3286 » On Computable Tree Functions |
163
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
179
click to vote
ICDCN
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
168
click to vote
CLUSTER
2009
IEEE
16 years 1 months ago
2009
IEEE
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
181
click to vote
BMEI
2008
IEEE
16 years 1 months ago
2008
IEEE
Multiple sequence alignment is the most fundamental task in bioinformatics and computational biology. In this paper, we present a new algorithm to conduct multiple sequences align...
198
click to vote
SRDS
2008
IEEE
16 years 1 months ago
2008
IEEE
The efficiency of service discovery is critical in the development of fully decentralized middleware intended to manage large scale computational grids. This demand influenced t...