Sciweavers

2489 search results - page 171 / 498
» On the Subgroup Distance Problem
Sort
View
ICALP
2009
Springer
16 years 4 months ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
Sudipto Guha, Zhiyi Huang
BIBE
2009
IEEE
126views Bioinformatics» more  BIBE 2009»
15 years 11 months ago
Mining Positional Association Super-Rules on Fixed-Size Protein Sequence Motifs
— Protein sequence motifs information is crucial to the analysis of biologically significant regions. The conserved regions have the potential to determine the role of the protei...
Bernard Chen, Sinan Kockara
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 8 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
PVLDB
2010
152views more  PVLDB 2010»
15 years 2 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
VLDB
2007
ACM
139views Database» more  VLDB 2007»
15 years 10 months ago
A Bayesian Method for Guessing the Extreme Values in a Data Set
For a large number of data management problems, it would be very useful to be able to obtain a few samples from a data set, and to use the samples to guess the largest (or smalles...
Mingxi Wu, Chris Jermaine