Sciweavers

4908 search results - page 857 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
16 years 6 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
16 years 6 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 6 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
16 years 6 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
SIGMOD
2005
ACM
178views Database» more  SIGMOD 2005»
16 years 6 months ago
Towards Effective Indexing for Very Large Video Sequence Database
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity sear...
Heng Tao Shen, Beng Chin Ooi, Xiaofang Zhou