Sciweavers

240 search results - page 3 / 48
» Efficient Variants of the Backward-Oracle-Matching Algorithm
Sort
View
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 7 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou
STOC
2009
ACM
107views Algorithms» more  STOC 2009»
14 years 8 months ago
Efficient discrete-time simulations of continuous-time quantum query algorithms
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuo...
Richard Cleve, Daniel Gottesman, Michele Mosca, Ro...
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
13 years 7 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
Maw-Shang Chang
ENTCS
2010
122views more  ENTCS 2010»
13 years 4 months ago
Efficient Earley Parsing with Regular Right-hand Sides
We present a new variant of the Earley parsing algorithm capable of efficiently supporting context-free grammars with regular right hand-sides. We present the core state-machine d...
Trevor Jim, Yitzhak Mandelbaum
AMC
2005
256views more  AMC 2005»
13 years 7 months ago
Improved DSA variant for batch verification
Batch verification is a method to verify multiple signatures at once. There are two issues associated with batch verification. One is the security problem and the other is the com...
Chu-Hsing Lin, Ruei-Hau Hsu, Lein Harn