4560 search results - page 18 / 912 » Finding Data in the Neighborhood |
BMCBI
2008
14 years 9 months ago
2008
Background: Determining the function of uncharacterized proteins is a major challenge in the post-genomic era due to the problem's complexity and scale. Identifying a protein...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, a novel subspace learning method, semi-supervised marginal discriminant analysis (SMDA), is proposed for classification. SMDA aims at maintaining the intrinsic neig...
BTW
1999
Springer
15 years 1 months ago
1999
Springer
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
109
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
84
Voted
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...