Sciweavers

3652 search results - page 362 / 731
» A study of query length
Sort
View
SOUPS
2009
ACM
15 years 10 months ago
Treat 'em like other devices: user authentication of multiple personal RFID tags
User-to-tag authentication can prevent a variety of potential attacks on personal RFID tags. In this poster, a new RFID authentication scheme is presented that allows a user to co...
Nitesh Saxena, Md. Borhan Uddin, Jonathan Voris
MFCS
2007
Springer
15 years 10 months ago
Finding Patterns in Given Intervals
In this paper, we study the pattern matching problem in given intervals. Depending on whether the intervals are given a priori for pre-processing, or during the query along with th...
Maxime Crochemore, Costas S. Iliopoulos, M. Sohel ...
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
15 years 8 months ago
Lower Bounds for Dynamic Algorithms
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
Michael L. Fredman
ECIR
2010
Springer
15 years 5 months ago
Evaluating the Potential of Explicit Phrases for Retrieval Quality
This paper evaluates the potential impact of explicit phrases on retrieval quality through a case study with the TREC Terabyte benchmark. It compares the performance of user- and s...
Andreas Broschart, Klaus Berberich, Ralf Schenkel
IPL
2006
103views more  IPL 2006»
15 years 4 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen