Sciweavers

254 search results - page 10 / 51
» Binary amiable Words
Sort
View
126
Voted
WACV
2012
IEEE
13 years 6 months ago
CompactKdt: Compact signatures for accurate large scale object recognition
We present a novel algorithm, Compact Kd-Trees (CompactKdt), that achieves state-of-the-art performance in searching large scale object image collections. The algorithm uses an or...
Mohamed Aly, Mario E. Munich, Pietro Perona
69
Voted
IPL
1998
177views more  IPL 1998»
14 years 10 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
JaeCheol Ha, Sang-Jae Moon
79
Voted
PRL
1998
92views more  PRL 1998»
14 years 10 months ago
Characterization of image degradation caused by scanning
A single parameter value that represents the difference between the original and the digitized characters is determined from a binary scan of a test chart. It represents the combi...
Elisa H. Barney Smith
CPC
2002
80views more  CPC 2002»
14 years 10 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger
113
Voted
TIT
2008
107views more  TIT 2008»
14 years 10 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak