Sciweavers

5889 search results - page 1122 / 1178
» Graph Layout Problems
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 1 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
GBRPR
2007
Springer
15 years 1 months ago
An Efficient Ontology-Based Expert Peering System
Abstract. This paper proposes an expert peering system for information exchange. Our objective is to develop a real-time search engine for an online community where users can ask e...
Tansu Alpcan, Christian Bauckhage, Sachin Agarwal
SPAA
2010
ACM
14 years 10 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
BMCBI
2008
228views more  BMCBI 2008»
14 years 10 months ago
Adaptive diffusion kernel learning from biological networks for protein function prediction
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...
Liang Sun, Shuiwang Ji, Jieping Ye
BMCBI
2008
160views more  BMCBI 2008»
14 years 10 months ago
Feature selection environment for genomic applications
Background: Feature selection is a pattern recognition approach to choose important variables according to some criteria in order to distinguish or explain certain phenomena (i.e....
Fabrício Martins Lopes, David Correa Martin...
« Prev « First page 1122 / 1178 Last » Next »