Sciweavers

358 search results - page 30 / 72
» GCD of Many Integers
Sort
View
JOT
2007
119views more  JOT 2007»
13 years 7 months ago
Observer-Conditioned-Observable Design Pattern
The Observer-Conditioned-Observable (OCO) combines digitizing and transcoding of numeric change events. During the processing of numeric events, the transcoder converts the number...
Douglas A. Lyon, Carl F. R. Weiman
JCT
1998
70views more  JCT 1998»
13 years 7 months ago
Partitions into Distinct Parts and Elliptic Curves
Let Q(N) denote the number of partitions of N into distinct parts. If ω(k) := 3k2 +k 2 , then it is well known that Q(N) + ∞X k=1 (−1)k “ Q(N − 2ω(k)) + Q(N − 2ω(−k)...
Ken Ono
ICPR
2004
IEEE
14 years 8 months ago
An FPGA-Based Architecture for Real Time Image Feature Extraction
We propose a novel FPGA-based architecture for the extraction of four texture features using Gray Level Cooccurrence Matrix (GLCM) analysis. These features are angular second mome...
Dimitrios E. Maroulis, Dimitrios K. Iakovidis, Dim...
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
14 years 7 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 7 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer