Sciweavers

7623 search results - page 362 / 1525
» Algorithmic Features of Eclat
Sort
View
202
Voted
ADMA
2009
Springer
142views Data Mining» more  ADMA 2009»
16 years 1 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Yan Wang, Jianguo Lu, Jessica Chen
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
16 years 1 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
CGO
2007
IEEE
16 years 1 months ago
Evaluating Heuristic Optimization Phase Order Search Algorithms
Program-specific or function-specific optimization phase sequences are universally accepted to achieve better overall performance than any fixed optimization phase ordering. A ...
Prasad Kulkarni, David B. Whalley, Gary S. Tyson
ICPP
2006
IEEE
16 years 24 days ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
ICPPW
2005
IEEE
16 years 11 days ago
Gene Ordering in Microarray Data Using Parallel Memetic Algorithms
This paper addresses the Microarray Gene Ordering problem. It consists in ordering a set of genes, grouping together the ones with similar behavior. This behavior can be measured ...
Alexandre Mendes, Carlos Cotta, Vinícius Ga...