Sciweavers

9842 search results - page 1435 / 1969
» Problem complexity
Sort
View
EWCBR
2004
Springer
16 years 17 days ago
Explanations and Case-Based Reasoning: Foundational Issues
By design, Case-Based Reasoning (CBR) systems do not need deep general knowledge. In contrast to (rule-based) expert systems, CBR systems can already be used with just some initial...
Thomas Roth-Berghofer
SMA
2003
ACM
118views Solid Modeling» more  SMA 2003»
16 years 12 days ago
Graph based topological analysis of tessellated surfaces
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
Tula Ram Ban, Dibakar Sen
WACV
2002
IEEE
16 years 2 days ago
Fingerprint Verification Using Genetic Algorithms
Fingerprint matching is still a challenging problem for reliable person authentication because of the complex distortions involved in two impressions of the same finger. In this p...
Xuejun Tan, Bir Bhanu
ICDT
2001
ACM
116views Database» more  ICDT 2001»
15 years 11 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
FPGA
2004
ACM
128views FPGA» more  FPGA 2004»
15 years 11 months ago
Incremental physical resynthesis for timing optimization
This paper presents a new approach to timing optimization for FPGA designs, namely incremental physical resynthesis, to answer the challenge of effectively integrating logic and p...
Peter Suaris, Lung-Tien Liu, Yuzheng Ding, Nan-Chi...
« Prev « First page 1435 / 1969 Last » Next »