Sciweavers

3652 search results - page 406 / 731
» A study of query length
Sort
View
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
15 years 11 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
CIKM
2009
Springer
15 years 11 months ago
A machine learning approach for improved BM25 retrieval
Despite the widespread use of BM25, there have been few studies examining its effectiveness on a document description over single and multiple field combinations. We determine t...
Krysta Marie Svore, Christopher J. C. Burges
CSR
2007
Springer
15 years 10 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
HPCC
2007
Springer
15 years 10 months ago
A Proactive Method for Content Distribution in a Data Indexed DHT Overlay
In a data-indexed DHT overlay network, published data annotations form distributed databases. Queries are distributed to these databases in a nonuniform way. Constructing content d...
Bassam A. Alqaralleh, Chen Wang, Bing Bing Zhou, A...
FCCM
2006
IEEE
137views VLSI» more  FCCM 2006»
15 years 10 months ago
Single Pass, BLAST-Like, Approximate String Matching on FPGAs
Abstract: Approximate string matching is fundamental to bioinformatics, and has been the subject of numerous FPGA acceleration studies. We address issues with respect to FPGA imple...
Martin C. Herbordt, Josh Model, Yongfeng Gu, Bhara...