Sciweavers

221 search results - page 22 / 45
» On Approximating the Radii of Point Sets in High Dimensions
Sort
View
LSSC
2001
Springer
14 years 2 days ago
On the Parallelization of the Sparse Grid Approach for Data Mining
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
Jochen Garcke, Michael Griebel
ACIVS
2006
Springer
14 years 1 months ago
Visibility of Point Clouds and Mapping of Unknown Environments
Abstract. We present an algorithm for interpolating the visible portions of a point cloud that are sampled from opaque objects in the environment. Our algorithm projects point clou...
Yanina Landa, Richard Tsai, Li-Tien Cheng
WWW
2004
ACM
14 years 8 months ago
Web data integration using approximate string join
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
Yingping Huang, Gregory R. Madey
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
13 years 11 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt
DATE
2009
IEEE
163views Hardware» more  DATE 2009»
14 years 2 months ago
Fixed points for multi-cycle path detection
—Accurate timing analysis is crucial for obtaining the optimal clock frequency, and for other design stages such as power analysis. Most methods for estimating propagation delay ...
Vijay D'Silva, Daniel Kroening