828 search results - page 111 / 166 » Simplicial Powers of Graphs |
TIT
2010
13 years 2 months ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
In this paper, the effect of the dimensionality of data sets on the exploitation of synergy among known nearest neighbor (NN) editing and condensing tools is analyzed using a synt...
ICTAI
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper a new learning scheme for SAT is proposed. The originality of our approach arises from its ability to achieve clause learning even if no conflict occurs. This clear...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...