Sciweavers

518 search results - page 19 / 104
» Beating a Random Assignment
Sort
View
106
Voted
AAAI
2004
15 years 1 months ago
Interactive Information Extraction with Constrained Conditional Random Fields
Information Extraction methods can be used to automatically "fill-in" database forms from unstructured data such as Web documents or email. State-of-the-art methods have...
Trausti T. Kristjansson, Aron Culotta, Paul A. Vio...
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
13 years 11 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...
74
Voted
AAAI
1994
15 years 1 months ago
Noise Strategies for Improving Local Search
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
Bart Selman, Henry A. Kautz, Bram Cohen
PAKDD
2004
ACM
100views Data Mining» more  PAKDD 2004»
15 years 5 months ago
Using Self-Consistent Naive-Bayes to Detect Masquerades
To gain access to account privileges, an intruder masquerades as the proper account user. This paper proposes a new strategy for detecting masquerades in a multiuser system. To det...
Kwong H. Yung
DAS
2008
Springer
15 years 1 months ago
Handling of Surface Modifications for Robust Image Based Mail Piece Comparison
Image based mail piece identification is a new technology for optimizing the postal sorting process. Exploiting the mail piece surface uniqueness, characteristic features are used...
Katja Worm, Beate Meffert