Sciweavers

9316 search results - page 1748 / 1864
» Analysis of traceback techniques
Sort
View
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 5 days ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
ICALP
2009
Springer
16 years 5 days ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
VLDB
2001
ACM
146views Database» more  VLDB 2001»
16 years 3 days ago
Combining multi-visual features for efficient indexing in a large image database
Abstract. The optimized distance-based access methods currently available for multidimensional indexing in multimedia databases have been developed based on two major assumptions: ...
Anne H. H. Ngu, Quan Z. Sheng, Du Q. Huynh, Ron Le...
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 3 days ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
16 years 1 days ago
Genome-scale disk-based suffix tree indexing
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
Benjarath Phoophakdee, Mohammed J. Zaki
« Prev « First page 1748 / 1864 Last » Next »