Sciweavers

2658 search results - page 472 / 532
» On efficient balanced codes
Sort
View
CLUSTER
2001
IEEE
15 years 8 months ago
Numerically-Intensive "Plug-and-Play" Parallel Computing
At UCLA's Plasma Physics Group, we have been successful in building and using a numerically-intensive parallel computing cluster using Power Macintosh hardware and the Macint...
Dean E. Dauger, Viktor K. Decyk
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
15 years 8 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge
PLDI
2000
ACM
15 years 8 months ago
Off-line variable substitution for scaling points-to analysis
Most compiler optimizations and software productivity tools rely on information about the effects of pointer dereferences in a program. The purpose of points-to analysis is to com...
Atanas Rountev, Satish Chandra
CRYPTO
1995
Springer
135views Cryptology» more  CRYPTO 1995»
15 years 8 months ago
Committed Oblivious Transfer and Private Multi-Party Computation
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
Claude Crépeau, Jeroen van de Graaf, Alain ...
CVPR
2010
IEEE
15 years 7 months ago
Fast pattern matching using orthogonal Haar transform
Pattern matching is a widely used procedure in signal processing, computer vision, image and video processing. Recently, methods using Walsh Hadamard Transform (WHT) and Gray-Code...
Wanli Ouyang, Renqi Zhang, Cham Wai-Kuen