Sciweavers

1240 search results - page 216 / 248
» Computational Structure of coordinate transformations: A gen...
Sort
View
PODS
2000
ACM
146views Database» more  PODS 2000»
15 years 2 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
IUI
2010
ACM
15 years 2 months ago
Automatic generation of research trails in web history
We propose the concept of research trails to help web users create and reestablish context across fragmented research processes without requiring them to explicitly structure and ...
Elin Rønby Pedersen, Karl Gyllstrom, Shengy...
CIKM
2009
Springer
15 years 1 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
15 years 1 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
EVOW
2010
Springer
15 years 1 months ago
Improving Multi-Relief for Detecting Specificity Residues from Multiple Sequence Alignments
A challenging problem in bioinformatics is the detection of residues that account for protein function specificity, not only in order to gain deeper insight in the nature of functi...
Elena Marchiori