Sciweavers

11384 search results - page 2177 / 2277
» Achieved IPC Performance
Sort
View
3DIM
2003
IEEE
14 years 1 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
KDD
2000
ACM
97views Data Mining» more  KDD 2000»
14 years 1 months ago
Towards an effective cooperation of the user and the computer for classification
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
Mihael Ankerst, Martin Ester, Hans-Peter Kriegel
RSCTC
2000
Springer
185views Fuzzy Logic» more  RSCTC 2000»
14 years 1 months ago
A Comparison of Several Approaches to Missing Attribute Values in Data Mining
: In the paper nine different approaches to missing attribute values are presented and compared. Ten input data files were used to investigate the performance of the nine methods t...
Jerzy W. Grzymala-Busse, Ming Hu
SAS
2000
Springer
149views Formal Methods» more  SAS 2000»
14 years 1 months ago
FULLDOC: A Full Reporting Debugger for Optimized Code
As compilers increasingly rely on optimizations to achieve high performance, the effectiveness of source level debuggers for optimized code continues to falter. Even if values of s...
Clara Jaramillo, Rajiv Gupta, Mary Lou Soffa
FPGA
1995
ACM
93views FPGA» more  FPGA 1995»
14 years 1 months ago
Simultaneous Depth and Area Minimization in LUT-based FPGA Mapping
In this paper, we present an improvement of the FlowMap algorithm, named CutMap, which combines depth and area minimization in the mapping process by computing min-cost min-height...
Jason Cong, Yean-Yow Hwang
« Prev « First page 2177 / 2277 Last » Next »