Sciweavers

3652 search results - page 306 / 731
» A study of query length
Sort
View
141
Voted
BMCBI
2006
141views more  BMCBI 2006»
15 years 3 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
BC
1998
98views more  BC 1998»
15 years 3 months ago
The dynamics of long-term exploration in the rat
A simple analytical model is proposed here that captures to a large extent the kinematic structure of rat exploratory behavior. Previous studies have shown that such behavior consi...
Ofer Tchernichovski, Yoav Benjamini, Ilan Golani
COLCOM
2008
IEEE
15 years 10 months ago
Collaborative Search and User Privacy: How Can They Be Reconciled?
Abstract. Collaborative search engines (CSE) let users pool their resources and share their experiences when seeking information on the web. However, when shared, search terms and ...
Thorben Burghardt, Erik Buchmann, Klemens Böh...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 8 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
144
Voted
JCSS
2008
120views more  JCSS 2008»
15 years 3 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson