1071 search results - page 184 / 215 » An analysis framework for search sequences |
111
click to vote
ANCS
2005
ACM
15 years 3 months ago
2005
ACM
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
BMCBI
2006
14 years 9 months ago
2006
Background: Several high-throughput searches for ppotential natural antisense transcripts (NATs) have been performed recently, but most of the reports were focused on cis type. A ...
ICS
2007
Tsinghua U.
15 years 3 months ago
2007
Tsinghua U.
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
KDD
2001
ACM
15 years 10 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
We address a specific enterprise document search scenario, where the information need is expressed in an elaborate manner. In our scenario, information needs are expressed using a...