Sciweavers

515 search results - page 71 / 103
» Layouts of Expander Graphs
Sort
View
FOCS
2009
IEEE
14 years 5 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
SIGIR
2008
ACM
13 years 10 months ago
Learning query intent from regularized click graphs
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
Xiao Li, Ye-Yi Wang, Alex Acero
BMCBI
2004
190views more  BMCBI 2004»
13 years 10 months ago
RAG: RNA-As-Graphs web resource
Background: The proliferation of structural and functional studies of RNA has revealed an increasing range of RNA's structural repertoire. Toward the objective of systematic ...
Daniela Fera, Namhee Kim, Nahum Shiffeldrim, Julie...
BMCBI
2011
13 years 2 months ago
RAG: An Update to the RNA-As-Graphs Resource
Background: In 2004, we presented a web resource for stimulating the search for novel RNAs, RNA-As-Graphs (RAG), which classified, catalogued, and predicted RNA secondary structur...
Joseph A. Izzo, Namhee Kim, Shereef Elmetwaly, Tam...
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 2 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko