Sciweavers

3652 search results - page 17 / 731
» A study of query length
Sort
View
APVIS
2006
13 years 9 months ago
Polygon labelling of minimum leader length
We study a variation of the boundary labelling problem, with floating sites (represented as polygons), labels of uniform size placed in fixed positions on the boundary of a rectan...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
TIT
2008
74views more  TIT 2008»
13 years 7 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf
SIGMOD
2004
ACM
114views Database» more  SIGMOD 2004»
14 years 7 months ago
An initial study of overheads of eddies
An eddy [2] is a highly adaptive query processing operator that continuously reoptimizes a query in response to changing runtime conditions. It does this by treating query process...
Amol Deshpande
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
13 years 9 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
BNCOD
2009
145views Database» more  BNCOD 2009»
13 years 8 months ago
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
Yuqing Wu, Dirk Van Gucht, Marc Gyssens, Jan Pared...