Sciweavers

49 search results - page 5 / 10
» Finding the Jaccard Median
Sort
View
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
13 years 9 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 7 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
13 years 9 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
MVA
2002
175views Computer Vision» more  MVA 2002»
13 years 7 months ago
Augmented geophysical data interpretation through automated velocity picking in semblance velocity images
Velocity Picking is the problem of picking velocity-time pairs based on a coherence metric between multiple seismic signals. Coherence as a function of velocity and time can be ex...
J. Ross Beveridge, Charlie Ross, L. Darrell Whitle...

Publication
104views
14 years 9 months ago
Examining travel distances by walking and cycling, Montréal, Canada
Active transportation – especially walking and cycling – is undergoing a surge in popularity in urban planning and transportation circles as a solution to the environmental and...
Yasmin, F., Larsen, J. & El-Geneidy, A.