2745 search results - page 270 / 549 » A fast algorithm for computing large Fibonacci numbers |
141
Voted
ICIP
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper introduces an efficient method to substantially increase the recognition performance of a vocabulary tree based recognition system. We propose to enhance the hypothesi...
157
Voted
SSD
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
156
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We introduce a distributed algorithm for solving large scale Support Vector Machines (SVM) problems. The algorithm divides the training set into a number of processing nodes each ...
178
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
149
Voted
SIAMSC
2008
15 years 4 months ago
2008
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...