198 search results - page 26 / 40 » Weak Probabilistic Anonymity |
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper develops a weakly supervised algorithm that learns to segment rigid multi-colored objects from a set of training images and key points. The approach uses congealing to ...
ICALP
1994
Springer
14 years 1 months ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
NAACL
2007
13 years 10 months ago
2007
We propose a high-performance cascaded hybrid model for Chinese NER. Firstly, we use Boosting, a standard and theoretically wellfounded machine learning method to combine a set of...
ICALP
2011
Springer
13 years 16 days ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
As part of a large effort to acquire large repositories of facts from unstructured text on the Web, a seed-based framework for textual information extraction allows for weakly sup...