Sciweavers

169 search results - page 2 / 34
» Efficient search space exploration for HW-SW partitioning
Sort
View
ISBI
2004
IEEE
14 years 5 months ago
Search Space Partitioning Using Convex Hull and Concavity Features for Fast Medical Image Retrieval
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
Phillip Mlsna, Nikolay Sirakov
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
13 years 8 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
ADBIS
2009
Springer
135views Database» more  ADBIS 2009»
13 years 2 months ago
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
Maxim Kormilitsin, Rada Chirkova, Yahya Fathi, Mat...
ICES
2010
Springer
148views Hardware» more  ICES 2010»
13 years 2 months ago
An Efficient Selection Strategy for Digital Circuit Evolution
In this paper, we propose a new modification of Cartesian Genetic Programming (CGP) that enables to optimize digital circuits more significantly than standard CGP. We argue that co...
Zbysek Gajda, Lukás Sekanina
DAWAK
2005
Springer
13 years 10 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou