Sciweavers

3652 search results - page 616 / 731
» A study of query length
Sort
View
SPAA
2009
ACM
16 years 5 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
118
Voted
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
15 years 10 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...
BMCBI
2010
112views more  BMCBI 2010»
15 years 4 months ago
Computational identification of rare codons of Escherichia coli based on codon pairs preference
Background: Codon bias is believed to play an important role in the control of gene expression. In Escherichia coli, some rare codons, which can limit the expression level of exog...
Xianming Wu, Songfeng Wu, Dong Li, Jiyang Zhang, L...
338
Voted

Tutorial
2179views
17 years 4 months ago
Privacy in Location-Based Services: State-of-the-Art and Research Directions
The explosive growth of location-detection devices (e.g., GPS-like devices and handheld devices) along with wireless communications and mobile databases results in realizing locati...
Mohamed F. Mokbel
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
16 years 5 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...