Sciweavers

2020 search results - page 10 / 404
» Speeding up Slicing
Sort
View
CVIU
2008
144views more  CVIU 2008»
13 years 7 months ago
Speeded-Up Robust Features (SURF)
This article presents a novel scale- and rotation-invariant detector and descriptor, coined SURF (Speeded-Up Robust Features). SURF approximates or even outperforms previously pro...
Herbert Bay, Andreas Ess, Tinne Tuytelaars, Luc J....
VISAPP
2010
13 years 7 months ago
Speeded up image matching using split and extended SIFT features
Matching feature points between images is one of the most fundamental issues in computer vision tasks. As the number of feature points increases, the feature matching rapidly becom...
Faraj Alhwarin, Danijela Ristić–Durrant and Axe...
SODA
2010
ACM
142views Algorithms» more  SODA 2010»
13 years 6 months ago
Speeding up random walks with neighborhood exploration
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
Petra Berenbrink, Colin Cooper, Robert Elsaesser, ...
CVPR
2006
IEEE
14 years 9 months ago
An Integrated Model of Top-Down and Bottom-Up Attention for Optimizing Detection Speed
Integration of goal-driven, top-down attention and image-driven, bottom-up attention is crucial for visual search. Yet, previous research has mostly focused on models that are pur...
Vidhya Navalpakkam, Laurent Itti
WAIFI
2010
Springer
160views Mathematics» more  WAIFI 2010»
13 years 11 months ago
Speeding Up Bipartite Modular Multiplication
Abstract. A large set of moduli, for which the speed of bipartite modular multiplication considerably increases, is proposed in this work. By considering state of the art attacks o...
Miroslav Knezevic, Frederik Vercauteren, Ingrid Ve...