Sciweavers

42230 search results - page 243 / 8446
» Algorithms and Complexity Results for
Sort
View
CORR
2008
Springer
154views Education» more  CORR 2008»
15 years 6 months ago
Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion...
Zheng Wang, Jie Luo
MM
2004
ACM
195views Multimedia» more  MM 2004»
16 years 1 days ago
Hierarchical clustering of WWW image search results using visual, textual and link information
We consider the problem of clustering Web image search results. Generally, the image search results returned by an image search engine contain multiple topics. Organizing the resu...
Deng Cai, Xiaofei He, Zhiwei Li, Wei-Ying Ma, Ji-R...
EDBT
2009
ACM
222views Database» more  EDBT 2009»
16 years 1 months ago
Data clouds: summarizing keyword search results over structured data
Keyword searches are attractive because they facilitate users searching structured databases. On the other hand, tag clouds are popular for navigation and visualization purposes o...
Georgia Koutrika, Zahra Mohammadi Zadeh, Hector Ga...
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
16 years 8 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
COCO
2006
Springer
96views Algorithms» more  COCO 2006»
15 years 10 months ago
Optimal Hardness Results for Maximizing Agreements with Monomials
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
Vitaly Feldman