255 search results - page 21 / 51 » A new upper bound for the bipartite Ramsey problem |
168
Voted
ICDM
2008
IEEE
16 years 16 days ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
147
click to vote
CN
2006
15 years 6 months ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
152
Voted
COCO
2009
Springer
16 years 20 days ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
139
click to vote
TIT
2011
15 years 1 months ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
176
click to vote
WAOA
2007
Springer
16 years 6 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...