Sciweavers

2297 search results - page 74 / 460
» A fast APRIORI implementation
Sort
View
CGF
2008
128views more  CGF 2008»
15 years 4 months ago
Hierarchical Convex Approximation of 3D Shapes for Fast Region Selection
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
Marco Attene, Michela Mortara, Michela Spagnuolo, ...
TSP
2010
14 years 11 months ago
Fast algorithms for the computation of sliding sequency-ordered complex hadamard transform
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
Jiasong Wu, Huazhong Shu, Lu Wang, Lotfi Senhadji
ICDE
2002
IEEE
189views Database» more  ICDE 2002»
16 years 5 months ago
A Fast Regular Expression Indexing Engine
In this paper, we describe the design, architecture, and the lessons learned from the implementation of a fast regular expression indexing engine FREE. FREE uses a prebuilt index ...
Junghoo Cho, Sridhar Rajagopalan
CIT
2007
Springer
15 years 10 months ago
A Fast Edge Detection Algorithm for Road Boundary Extraction under Non-uniform Light Condition
In this paper a fast edge detection algorithm based on a simple logic has been implemented for road boundary detection in non-uniform light condition. Road images taken in the cam...
Aurobinda Routray, Kanungo Barada Mohanty
DAGM
2005
Springer
15 years 9 months ago
A Method for Fast Search of Variable Regions on Dynamic 3D Point Clouds
The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing devi...
Eric Wahl, Gerd Hirzinger