Sciweavers

4315 search results - page 53 / 863
» Sorting in linear time
Sort
View
CG
2006
Springer
13 years 7 months ago
Optimal blurred segments decomposition of noisy shapes in linear time
Blurred segments were introduced by Debled-Rennesson et al. [Segmentation of discrete curves into fuzzy segments. In: 9th IWCIA, Electronic notes in discrete mathematics, vol. 12;...
Isabelle Debled-Rennesson, Fabien Feschet, Jocelyn...
CIDM
2007
IEEE
14 years 2 months ago
Privacy Preserving Burst Detection of Distributed Time Series Data Using Linear Transforms
— In this paper, we consider burst detection within the context of privacy. In our scenario, multiple parties want to detect a burst in aggregated time series data, but none of t...
Lisa Singh, Mehmet Sayal
CCECE
2006
IEEE
14 years 1 months ago
Group-Optimal Linear Space-Time Multiuser Detection
Multiuser detection (MUD) techniques are known to improve the performance of CDMA cellular communication systems. This performance improvement usually comes at a large computation...
Benoit Pelletier, Benoît Champagne
SPIRE
2005
Springer
14 years 1 months ago
Linear Time Algorithm for the Generalised Longest Common Repeat Problem
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U, conside...
Inbok Lee, Yoan José Pinzón Ardila
ALGORITHMICA
2008
52views more  ALGORITHMICA 2008»
13 years 7 months ago
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
V. Berry, Z. S. Peng, H. F. Ting