Sciweavers

1632 search results - page 53 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
COMPGEOM
2011
ACM
14 years 7 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
162
Voted
FOCS
2002
IEEE
15 years 8 months ago
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
Andrej Bogdanov, Kenji Obata, Luca Trevisan
CORR
2007
Springer
111views Education» more  CORR 2007»
15 years 3 months ago
Capacity of Sparse Multipath Channels in the Ultra-Wideband Regime
—This paper studies the ergodic capacity of time- and frequency-selective multipath fading channels in the ultrawideband (UWB) regime when training signals are used for channel e...
Vasanthan Raghavan, Gautham Hariharan, Akbar M. Sa...
COMPGEOM
2006
ACM
15 years 9 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
SIAMSC
2008
179views more  SIAMSC 2008»
15 years 3 months ago
Multigrid Algorithms for Inverse Problems with Linear Parabolic PDE Constraints
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
Santi S. Adavani, George Biros