Sciweavers

727 search results - page 135 / 146
» Improving Twitter Retrieval by Exploiting Structural Informa...
Sort
View
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
11 years 11 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
CCS
2008
ACM
13 years 10 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
LCTRTS
2009
Springer
14 years 3 months ago
Guaranteeing instruction fetch behavior with a lookahead instruction fetch engine (LIFE)
Instruction fetch behavior has been shown to be very regular and predictable, even for diverse application areas. In this work, we propose the Lookahead Instruction Fetch Engine (...
Stephen Roderick Hines, Yuval Peress, Peter Gavin,...
BMCBI
2005
119views more  BMCBI 2005»
13 years 8 months ago
The distance-profile representation and its application to detection of distantly related protein families
Background: Detecting homology between remotely related protein families is an important problem in computational biology since the biological properties of uncharacterized protei...
Chin-Jen Ku, Golan Yona
WWW
2010
ACM
14 years 3 months ago
A scalable machine-learning approach for semi-structured named entity recognition
Named entity recognition studies the problem of locating and classifying parts of free text into a set of predefined categories. Although extensive research has focused on the de...
Utku Irmak, Reiner Kraft