2127 search results - page 242 / 426 » Computing large matchings fast |
131
click to vote
SIGECOM
2003
ACM
15 years 9 months ago
2003
ACM
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
165
click to vote
BMCBI
2002
15 years 4 months ago
2002
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
158
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
111
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
247
Voted
ICDE
1997
IEEE
16 years 5 months ago
1997
IEEE
There are two major challenges for a high-performance remote-sensing database. First, it must provide low-latency retrieval of very large volumes of spatio-temporaldata. This requ...