Sciweavers

116 search results - page 3 / 24
» Analyzing the Performance of Pattern Database Heuristics
Sort
View
AAAI
2004
13 years 7 months ago
Space-Efficient Memory-Based Heuristics
A memory-based heuristic is a heuristic function that is stored in a lookup table. Very accurate heuristics have been created by building very large lookup tables, sometimes calle...
Rong Zhou, Eric A. Hansen
BMCBI
2007
207views more  BMCBI 2007»
13 years 6 months ago
Analyzing in situ gene expression in the mouse brain with image registration, feature extraction and block clustering
Background: Many important high throughput projects use in situ hybridization and may require the analysis of images of spatial cross sections of organisms taken with cellular lev...
Manjunatha Jagalur, Chris Pal, Erik G. Learned-Mil...
AAAI
2010
13 years 7 months ago
Searching Without a Heuristic: Efficient Use of Abstraction
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
Bradford John Larsen, Ethan Burns, Wheeler Ruml, R...
SIGMOD
2005
ACM
138views Database» more  SIGMOD 2005»
14 years 6 months ago
Automatic Physical Database Tuning: A Relaxation-based Approach
In recent years there has been considerable research on automated selection of physical design in database systems. In current solutions, candidate access paths are heuristically ...
Nicolas Bruno, Surajit Chaudhuri
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
13 years 4 months ago
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo