Sciweavers

3652 search results - page 106 / 731
» A study of query length
Sort
View
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 8 months ago
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
NAR
2010
106views more  NAR 2010»
13 years 2 months ago
Protein Geometry Database: a flexible engine to explore backbone conformations and their relationships to covalent geometry
The backbone bond lengths, bond angles, and planarity of a protein are influenced by the backbone conformation (u,w), but no tool exists to explore these relationships, leaving th...
Donald S. Berkholz, Peter B. Krenesky, John R. Dav...
CIKM
2009
Springer
14 years 2 months ago
Analyzing and evaluating query reformulation strategies in web search logs
Users frequently modify a previous search query in hope of retrieving better results. These modifications are called query reformulations or query refinements. Existing research h...
Jeff Huang, Efthimis N. Efthimiadis
ICDE
2010
IEEE
562views Database» more  ICDE 2010»
14 years 7 months ago
Multi-Guarded Safe Zone: An Effective Technique to Monitor Moving Circular Range Queries
Given a positive value r, a circular range query returns the objects that lie within the distance r of the query location. In this paper, we study the circular range queries that c...
Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin ...
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
14 years 8 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger