1162 search results - page 45 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
150
click to vote
AAAI
2010
15 years 5 months ago
2010
Spectral feature selection identifies relevant features by measuring their capability of preserving sample similarity. It provides a powerful framework for both supervised and uns...
116
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
133
click to vote
ICMLA
2008
15 years 5 months ago
2008
Dimension reduction techniques have been successfully applied to face recognition and text information retrieval. The process can be time-consuming when the data set is large. Thi...
137
click to vote
ALGORITHMICA
2002
15 years 3 months ago
2002
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...
123
click to vote
ICIP
2001
IEEE
16 years 5 months ago
2001
IEEE
Gauss mixtures have gained popularity in statistics and statistical signal processing applications for a variety of reasons, including their ability to well approximatea large cla...