Sciweavers

556 search results - page 28 / 112
» A Comparative Study of Some Generalized Rough Approximations
Sort
View
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 5 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
227
Voted
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 2 months 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...
168
Voted
DAM
2011
14 years 8 months ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz
ERCIMDL
2007
Springer
87views Education» more  ERCIMDL 2007»
15 years 8 months ago
A Model of Uncertainty for Near-Duplicates in Document Reference Networks
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
Claudia Hess, Michel de Rougemont
106
Voted
WPES
2006
ACM
15 years 7 months ago
A study on the value of location privacy
This paper introduces results of a study into the value of location privacy for individuals using mobile devices. We questioned a sample of over 1200 people from five EU countrie...
Daniel Cvrcek, Marek Kumpost, Vashek Matyas, Georg...