Sciweavers

4302 search results - page 192 / 861
» Index Pairs Algorithms
Sort
View
VLDB
1998
ACM
123views Database» more  VLDB 1998»
14 years 3 months ago
Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships
Time of creation is one of the predominant (often implicit) clustering strategies found not only in Data Warehouse systems: line items are created together with their correspondin...
Sven Helmer, Till Westmann, Guido Moerkotte
ENC
2004
IEEE
14 years 2 months ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...
RIVF
2008
14 years 6 days ago
Speeding up subset seed algorithm for intensive protein sequence comparison
Abstract--Sequence similarity search is a common and repeated task in molecular biology. The rapid growth of genomic databases leads to the need of speeding up the treatment of thi...
Van Hoa Nguyen, Dominique Lavenier
ICNC
2005
Springer
14 years 4 months ago
Genetic Algorithms for Thyroid Gland Ultrasound Image Feature Reduction
The problem of automatic classification of ultrasound images is addressed. For texture analysis of ultrasound images quantifiable indexes, called features, are used. Classificat...
Ludvík Tesar, Daniel Smutek, Jan Jiskra
DMSN
2004
ACM
14 years 4 months ago
KPT: a dynamic KNN query processing algorithm for location-aware sensor networks
An important type of spatial queries for sensor networks are K Nearest Neighbor (KNN) queries. Currently, research proposals for KNN query processing is based on index structures,...
Julian Winter, Wang-Chien Lee