Sciweavers

1283 search results - page 223 / 257
» Probabilistic structured query methods
Sort
View
FOCS
2006
IEEE
14 years 3 months ago
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
Mihai Patrascu, Mikkel Thorup
DEXAW
2000
IEEE
76views Database» more  DEXAW 2000»
14 years 1 months ago
A Semantical Twist to Syntactical Navigation
Given their simple nature, the success of keyword based retrieval systems is astonishing. Although these methods seemingly only process words (and their word counts), they rely on...
F. Grootjen
VL
1995
IEEE
121views Visual Languages» more  VL 1995»
14 years 25 days ago
Buffering of Intermediate Results in Dataflow Diagrams
Buffering of intermediate results in dataflow diagrams can significantly reduce latency when a user browses these results or re-executes a diagram with slightly different inputs. ...
Allison Woodruff, Michael Stonebraker
DEXA
2005
Springer
111views Database» more  DEXA 2005»
13 years 11 months ago
On the General Signature Trees
The signature file method is a popular indexing technique used in information retrieval and databases. It excels in efficient index maintenance and lower space overhead. Different ...
Yangjun Chen
WWW
2010
ACM
14 years 4 months ago
Equip tourists with knowledge mined from travelogues
With the prosperity of tourism and Web 2.0 technologies, more and more people have willingness to share their travel experiences on the Web (e.g., weblogs, forums, or Web 2.0 comm...
Qiang Hao, Rui Cai, Changhu Wang, Rong Xiao, Jiang...