Sciweavers

358 search results - page 72 / 72
» GCD of Many Integers
Sort
View
TSP
2010
12 years 11 months ago
Noninvertible gabor transforms
Abstract--Time-frequency analysis, such as the Gabor transform, plays an important role in many signal processing applications. The redundancy of such representations is often dire...
Ewa Matusiak, Tomer Michaeli, Yonina C. Eldar
ECCC
2007
147views more  ECCC 2007»
13 years 4 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 4 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye