Sciweavers

40 search results - page 2 / 8
» Can Random Coin Flips Speed Up a Computer
Sort
View
FOCS
1990
IEEE
13 years 9 months ago
Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract)
d abstract) Noga Alon IBM Almaden Research Center, San Jose, CA 95120 and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel Moni Naor IBM Almaden Research Ce...
Noga Alon, Moni Naor
ECCV
2006
Springer
14 years 7 months ago
SURF: Speeded Up Robust Features
In this paper, we present a novel scale- and rotation-invariant interest point detector and descriptor, coined SURF (Speeded Up Robust Features). It approximates or even outperform...
Herbert Bay, Tinne Tuytelaars, Luc J. Van Gool
CVIU
2008
144views more  CVIU 2008»
13 years 5 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....
GLVLSI
2009
IEEE
146views VLSI» more  GLVLSI 2009»
13 years 9 months ago
A reconfigurable stochastic architecture for highly reliable computing
Mounting concerns over variability, defects and noise motivate a new approach for integrated circuits: the design of stochastic logic, that is to say, digital circuitry that opera...
Xin Li, Weikang Qian, Marc D. Riedel, Kia Bazargan...
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 10 days ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...