2514 search results - page 233 / 503 » On the Computation of Approximations of Database Queries |
195
click to vote
BIBE
2005
IEEE
16 years 8 days ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
200
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
209
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
149
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
154
click to vote
CHI
2002
ACM
16 years 7 months ago
2002
ACM
Navigational Blocks provide a tangible user interface for applications such as information kiosks. Orientation, movement, and relative position of electronically and microprocesso...