1709 search results - page 102 / 342 » Comparing the Performance of Database Selection Algorithms |
145
click to vote
BMCBI
2006
15 years 5 months ago
2006
Background: Many of the most popular pre-processing methods for Affymetrix expression arrays, such as RMA, gcRMA, and PLIER, simultaneously analyze data across a set of predetermi...
121
click to vote
HT
1991
ACM
15 years 8 months ago
1991
ACM
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
113
click to vote
ICCV
1998
IEEE
16 years 7 months ago
1998
IEEE
Proceedings of the 1998 IEEE International Conference on Computer Vision, Bombay, India We introduce a new distance between two distributions that we call the Earth Mover's D...
133
Voted
ISCAS
2005
IEEE
15 years 10 months ago
2005
IEEE
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...
159
click to vote
ICCS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...