Sciweavers

66 search results - page 4 / 14
» Spatio-temporal data reduction with deterministic error boun...
Sort
View
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
13 years 11 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
ICALP
2007
Springer
14 years 4 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
TCSV
2002
161views more  TCSV 2002»
13 years 9 months ago
Blocking artifact detection and reduction in compressed data
A novel frequency-domain technique for image blocking artifact detection and reduction is presented in this paper. The algorithm first detects the regions of the image which presen...
George A. Triantafyllidis, Dimitrios Tzovaras, Mic...
ACL
2006
13 years 11 months ago
Graph Transformations in Data-Driven Dependency Parsing
Transforming syntactic representations in order to improve parsing accuracy has been exploited successfully in statistical parsing systems using constituency-based representations...
Jens Nilsson, Joakim Nivre, Johan Hall
FOCS
2006
IEEE
14 years 3 months ago
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
Mihai Patrascu, Mikkel Thorup