Sciweavers

1846 search results - page 33 / 370
» Generating query substitutions
Sort
View
SIGIR
2010
ACM
13 years 7 months ago
Learning to rank query reformulations
Query reformulation techniques based on query logs have recently proven to be effective for web queries. However, when initial queries have reasonably good quality, these techniqu...
Van Dang, Michael Bendersky, W. Bruce Croft
CHES
2004
Springer
135views Cryptology» more  CHES 2004»
14 years 1 months ago
TTS: High-Speed Signatures on a Low-Cost Smart Card
TTS is a genre of multivariate digital signature schemes first proposed in 2002. Its public map is composed of two affine maps sandwiching a Tame Map, which is a map invertible t...
Bo-Yin Yang, Jiun-Ming Chen, Yen-Hung Chen
ACL
2012
11 years 10 months ago
Grammar Error Correction Using Pseudo-Error Sentences and Domain Adaptation
This paper presents grammar error correction for Japanese particles that uses discriminative sequence conversion, which corrects erroneous particles by substitution, insertion, an...
Kenji Imamura, Kuniko Saito, Kugatsu Sadamitsu, Hi...
SIGMOD
2008
ACM
203views Database» more  SIGMOD 2008»
14 years 7 months ago
Querying continuous functions in a database system
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
Arvind Thiagarajan, Samuel Madden
VLDB
1995
ACM
97views Database» more  VLDB 1995»
13 years 11 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch