Sciweavers

1012 search results - page 50 / 203
» Segment intersection searching problems in general settings
Sort
View
JCDL
2005
ACM
138views Education» more  JCDL 2005»
15 years 5 months ago
Comparative study of name disambiguation problem using a scalable blocking-based framework
In this paper, we consider the problem of ambiguous author names in bibliographic citations, and comparatively study alternative approaches to identify and correct such name varia...
Byung-Won On, Dongwon Lee, Jaewoo Kang, Prasenjit ...
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
15 years 5 months ago
A Novel Multi-objective Orthogonal Simulated Annealing Algorithm for Solving Multi-objective Optimization Problems with a Large
In this paper, a novel multi-objective orthogonal simulated annealing algorithm MOOSA using a generalized Pareto-based scale-independent fitness function and multi-objective intell...
Li-Sun Shu, Shinn-Jang Ho, Shinn-Ying Ho, Jian-Hun...
CVPR
2004
IEEE
16 years 1 months ago
Recovering Human Body Configurations: Combining Segmentation and Recognition
The goal of this work is to take an image such as the one in Figure 1(a), detect a human figure, and localize his joints and limbs (b) along with their associated pixel masks (c)....
Greg Mori, Xiaofeng Ren, Alexei A. Efros, Jitendra...
ISMIS
1999
Springer
15 years 4 months ago
Applications and Research Problems of Subgroup Mining
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
Willi Klösgen
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 6 days ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...