Sciweavers

1403 search results - page 121 / 281
» Set cover algorithms for very large datasets
Sort
View
105
Voted
BCSHCI
2007
15 years 6 months ago
Visualising Bluetooth interactions: combining the Arc diagram and DocuBurst techniques
Within the Bluetooth mobile space, overwhelmingly large sets of interaction and encounter data can very quickly be accumulated. This presents a challenge to gaining an understandi...
Daragh Byrne, Barry Lavelle, Gareth J. F. Jones, A...
CIKM
1998
Springer
15 years 8 months ago
Supporting Fast Search in Time Series for Movement Patterns in Multiple Scales
An important investigation of time series involves searching for \movement" patterns, such as \going up" or \going down" or some combinations of them. Movement patt...
Yunyao Qu, Changzhou Wang, Xiaoyang Sean Wang
WEBI
2009
Springer
15 years 11 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova
149
Voted
SIGMOD
2012
ACM
246views Database» more  SIGMOD 2012»
13 years 7 months ago
Skimmer: rapid scrolling of relational query results
A relational database often yields a large set of tuples as the result of a query. Users browse this result set to find the information they require. If the result set is large, ...
Manish Singh, Arnab Nandi, H. V. Jagadish
BMCBI
2007
105views more  BMCBI 2007»
15 years 4 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen