Sciweavers

560 search results - page 18 / 112
» Multiplication by a Constant is Sublinear
Sort
View
CVPR
2008
IEEE
14 years 10 months ago
Scene classification with low-dimensional semantic spaces and weak supervision
A novel approach to scene categorization is proposed. Similar to previous works of [11, 15, 3, 12], we introduce an intermediate space, based on a low dimensional semantic "t...
Nikhil Rasiwasia, Nuno Vasconcelos
PLDI
1994
ACM
14 years 2 days ago
Division by Invariant Integers using Multiplication
Integer division remains expensive on today's processors as the cost of integer multiplication declines. We present code sequences for division by arbitrary nonzero integer c...
Torbjörn Granlund, Peter L. Montgomery
FIWAC
1993
139views Cryptology» more  FIWAC 1993»
14 years 2 days ago
Montgomery-Suitable Cryptosystems
Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A, B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is o...
David Naccache, David M'Raïhi
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 8 months ago
Menger's Paths with Minimum Mergings
For an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Menger's paths between the sources and the sinks such that the number...
Guangyue Han
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
13 years 9 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...