Sciweavers

11129 search results - page 298 / 2226
» Modeling Search Computing Applications
Sort
View
IPPS
2003
IEEE
15 years 12 months ago
A Fast Algorithm for the Exhaustive Analysis of 12-Nucleotide-Long DNA Sequences. Applications to Human Genomics
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
Vicente Arnau, Ignacio Marín
DSN
2002
IEEE
15 years 11 months ago
32-Bit Cyclic Redundancy Codes for Internet Applications
Standardized 32-bit Cyclic Redundancy Codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethern...
Philip Koopman
GCC
2004
Springer
16 years 2 days ago
Efficient Search Using Adaptive Metadata Spreading in Peer-to-Peer Networks
Abstract. Search is until now a difficult problem in peer-to-peer (P2P) filesharing systems. In this paper, we propose to use adaptive metadata spreading to make search in P2P netw...
Xuezheng Liu, Guangwen Yang, Ming Chen, Yongwei Wu
COGSCI
2007
139views more  COGSCI 2007»
15 years 6 months ago
Mapping the Color Space of Saccadic Selectivity in Visual Search
Color coding is used to guide attention in computer displays for such critical tasks as baggage screening or air traffic control. It has been shown that a display object attracts...
Yun Xu, Emily C. Higgins, Mei Xiao, Marc Pomplun
SIGIR
2008
ACM
15 years 6 months ago
Optimizing relevance and revenue in ad search: a query substitution approach
The primary business model behind Web search is based on textual advertising, where contextually relevant ads are displayed alongside search results. We address the problem of sel...
Filip Radlinski, Andrei Z. Broder, Peter Ciccolo, ...