Sciweavers

933 search results - page 10 / 187
» Fully automatic cross-associations
Sort
View
JSCIC
2002
47views more  JSCIC 2002»
14 years 11 months ago
A Fully Automatic hp-Adaptivity
L. Demkowicz, W. Rachowicz, Ph. Devloo
131
Voted
LKR
2008
15 years 1 months ago
Design and Prototype of a Large-Scale and Fully Sense-Tagged Corpus
Sense tagged corpus plays a very crucial role to Natural Language Processing, especially on the research of word sense disambiguation and natural language understanding. Having a l...
Sue-jin Ker, Chu-Ren Huang, Jia-Fei Hong, Shi-Yin ...
COLING
2008
15 years 1 months ago
A Fully-Lexicalized Probabilistic Model for Japanese Zero Anaphora Resolution
This paper presents a probabilistic model for Japanese zero anaphora resolution. First, this model recognizes discourse entities and links all mentions to them. Zero pronouns are ...
Ryohei Sasano, Daisuke Kawahara, Sadao Kurohashi
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
15 years 6 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
WIAMIS
2009
IEEE
15 years 6 months ago
Towards fully un-supervised methods for generating object detection classifiers using social data
In this work a framework for constructing object detection classifiers using weakly annotated social data is proposed. Social information is combined with computer vision techniq...
Spiros Nikolopoulos, Elisavet Chatzilari, Eirini G...