340 search results - page 37 / 68 » Clustering with Lower Bound on Similarity |
172
Voted
VLDB
2007
ACM
16 years 29 days ago
2007
ACM
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...
BMCBI
2006
15 years 24 days ago
2006
Background: The recent advancement of microarray technology with lower noise and better affordability makes it possible to determine expression of several thousand genes simultane...
101
click to vote
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
169
click to vote
CALCO
2011
Springer
14 years 22 days ago
2011
Springer
Abstract. We propose a probabilistic interpretation of a class of reversible communicating processes. The rate of forward and backward computing steps, instead of being given expli...
103
Voted
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...