Sciweavers

2374 search results - page 33 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
TVLSI
1998
124views more  TVLSI 1998»
15 years 1 months ago
Computing support-minimal subfunctions during functional decomposition
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
Christian Legl, Bernd Wurth, Klaus Eckl
ACSAC
2010
IEEE
14 years 12 months ago
Fast and practical instruction-set randomization for commodity systems
Instruction-set randomization (ISR) is a technique based on randomizing the "language" understood by a system to protect it from code-injection attacks. Such attacks wer...
Georgios Portokalidis, Angelos D. Keromytis
106
Voted
DATAMINE
1999
113views more  DATAMINE 1999»
15 years 1 months ago
A Fast Parallel Clustering Algorithm for Large Spatial Databases
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
Xiaowei Xu, Jochen Jäger, Hans-Peter Kriegel
ECCV
2008
Springer
16 years 3 months ago
A Fast Algorithm for Creating a Compact and Discriminative Visual Codebook
In patch-based object recognition, using a compact visual codebook can boost computational efficiency and reduce memory cost. Nevertheless, compared with a large-sized codebook, it...
Lei Wang, Luping Zhou, Chunhua Shen
ACIVS
2005
Springer
15 years 7 months ago
A Fast Sequential Rainfalling Watershed Segmentation Algorithm
Abstract. In this paper we present a new implementation of a rainfalling watershed segmentation algorithm. Our previous algorithm was a one-run algorithm. All the steps needed to c...
Johan de Bock, Patrick de Smet, Wilfried Philips