Sciweavers

291 search results - page 36 / 59
» The Bidimensionality Theory and Its Algorithmic Applications
Sort
View
CIKM
2008
Springer
15 years 8 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
FOCS
2004
IEEE
15 years 10 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 7 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
TSP
2008
166views more  TSP 2008»
15 years 6 months ago
Nonuniform Sampling of Periodic Bandlimited Signals
Abstract--Digital processing techniques are based on representing a continuous-time signal by a discrete set of samples. This paper treats the problem of reconstructing a periodic ...
E. Margolis, Yonina C. Eldar
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
16 years 3 days ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm