4009 search results - page 541 / 802 » Clustering on Complex Graphs |
164
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Feature selection is an approach to overcome the 'curse of dimensionality' in complex researches like disease classification using microarrays. Statistical m...
152
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
186
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
184
click to vote
QSHINE
2005
IEEE
16 years 6 days ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
159
click to vote
SEMWEB
2005
Springer
16 years 3 days ago
2005
Springer
Recommender algorithms have been quite successfully employed in a variety of scenarios from filtering applications to recommendations of movies and books at Amazon.com. However, a...