184 search results - page 17 / 37 » Cache-oblivious data structures for orthogonal range searchi... |
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
100
click to vote
ACL
2011
14 years 3 months ago
2011
Marking up search queries with linguistic annotations such as part-of-speech tags, capitalization, and segmentation, is an important part of query processing and understanding in ...
119
click to vote
CSB
2003
IEEE
15 years 5 months ago
2003
IEEE
Recognition of a protein’s fold provides valuable information about its function. While many sequence-based homology prediction methods exist, an important challenge remains: tw...
105
click to vote
TSP
2010
14 years 6 months ago
2010
A novel (differential) entropy estimator is introduced where the maximum entropy bound is used to approximate the entropy given the observations, and is computed using a numerical ...
WWW
2008
ACM
16 years 13 days ago
2008
ACM
Information sharing can be effective with structured data. The Semantic Web is mainly aimed at structuring information by creating widely accepted ontologies. However, users have ...