Sciweavers

1816 search results - page 21 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 3 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
ICPR
2006
IEEE
16 years 27 days ago
A Maximum-Likelihood Approach to Symbolic Indirect Correlation
Symbolic Indirect Correlation (SIC) is a nonparametric method that offers significant advantages for recognition of ordered unsegmented signals. A previously introduced formulatio...
Ashutosh Joshi, Daniel P. Lopresti, George Nagy, S...
AMC
2005
206views more  AMC 2005»
14 years 11 months ago
Logistics networks: A game theory application for solving the transshipment problem
As competition from emerging economies such as China and India puts pressure on global supply chains and as new constraints emerge, it presents opportunities for approaches such a...
Pedro M. Reyes
JUCS
2008
159views more  JUCS 2008»
14 years 11 months ago
Two Step Swarm Intelligence to Solve the Feature Selection Problem
: In this paper we propose a new approach to Swarm Intelligence called Two-Step Swarm Intelligence. The basic idea is to split the heuristic search performed by agents into two sta...
Yudel Gómez, Rafael Bello, Amilkar Puris, M...
MICS
2008
124views more  MICS 2008»
14 years 10 months ago
Community Structures of Networks
We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a collection of nodes and (b) a co...
William Y. C. Chen, Andreas W. M. Dress, Winking Q...